18090 search results - page 640 / 3618 » Computing by Only Observing |
180
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...
163
click to vote
SIAMJO
2008
15 years 7 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
161
click to vote
ACL
2010
15 years 5 months ago
2010
We pose the development of cognitively plausible models of human language processing as a challenge for computational linguistics. Existing models can only deal with isolated phen...
161
click to vote
APAL
2006
15 years 7 months ago
2006
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence c...
186
click to vote
CVPR
2004
IEEE
16 years 9 months ago
2004
IEEE
This paper deals with the error analysis of a novel navigation algorithm that uses as input the sequence of images acquired from a moving camera and a Digital Terrain (or Elevatio...