2168 search results - page 7 / 434 » Randomized Algorithms and Complexity Theory |
224
Voted
LCC
1994
15 years 5 months ago
1994
108
Voted
FOCS
1999
IEEE
15 years 5 months ago
1999
IEEE
We study the phenomenon of cognitive learning from an algorithmic standpoint. How does the brain effectively learn concepts from a small number of examples despite the fact that e...
104
Voted
COCO
1994
Springer
15 years 5 months ago
1994
Springer
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
125
Voted
STOC
2006
ACM
16 years 1 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
94
Voted
ICCV
2003
IEEE
16 years 3 months ago
2003
IEEE
In this paper, we present a mathematical theory for Marr's primal sketch. We first conduct a theoretical study of the descriptive Markov random field model and the generative...