Sciweavers

2338 search results - page 53 / 468
» Separation in Theory - Coordination in Practice
Sort
View
CCA
2009
Springer
14 years 3 months ago
Separations of Non-monotonic Randomness Notions
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...
Laurent Bienvenu, Rupert Hölzl, Thorsten Kr&a...
WEA
2010
Springer
280views Algorithms» more  WEA 2010»
14 years 3 months ago
Practical Nearest Neighbor Search in the Plane
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 ...
Michael Connor, Piyush Kumar
ACL
1994
13 years 10 months ago
Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars
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...
John Carroll
ECTEL
2006
Springer
14 years 18 days ago
Informal Learning Theories and Tools to Support Knowledge Management in Distributed CoPs
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 ...
Maria Chiara Pettenati, Maria Ranieri
ETS
2002
IEEE
132views Hardware» more  ETS 2002»
13 years 8 months ago
Theories for Deep Change in Affect-sensitive Cognitive Machines: A Constructivist Model
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...
Barry Kort, Rob Reilly