-
When I use hop, the jump hints seem randomly ordered. It would be nice if the first, second, third, forth, etc positions were always the same character hints (respectively as `asdf`), like in EasyMo…
-
@zietzm is currently working in the Greene Lab for the summer before he departs to start his PhD at Columbia University in the fall. @zietzm's work from his time in the lab will likely be divided into…
-
{noformat}Defining a GLM Model
~~~~~~~~~~~~~~~~~~~~
Parameters are optional unless specified as *required*.
Algorithm-specific parameters
'''''''''''''''''''''''''''''
- `rand_family `__: The Rand…
-
@mraross commented on [Fri Mar 03 2017](https://github.com/bcgov/api-specs/issues/153)
## Problem statement
When computing best route, the Route Planner needs to take into account the following:…
-
Wondering if something could be done to support multiplayer instead of having everyone spawning in the same island
-
This post lists review questions on several documents I have written.
----
----
**The requests and open questions for all my articles are now in a dedicated page: [Requests and Open Questions](…
-
The notes feature is great, and the greatest part of it is that they are localized.
To take full advantage of this we need a new layout for the notes where e.g. an icon on the right shows that there…
-
**Is your feature request related to a problem? Please describe.**
I am using the Louvain algorithm to discover communities in my graph; however, each execution of the algorithm returns different r…
-
You do not give details on the indexes chosen in the comparison methods. From the runtime numbers, it appears that you did not add enable an index in ELKI? Do the runtimes include JVM startup cost, R …
-
We would like to have a proper part on the concentration inequalities.
This is very important in computer science and in algorithms analysis because the runtime and the errors are bounded using to…