In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorit...
In this work informal learning theories and practices and social networking features are taken as starting points to build a reference collaboration model to support collaborative ...
There is interplay between emotions and learning, but this interaction is far more complex than previous learning theories have articulated--this interplay interacts with other re...