3837 search results - page 323 / 768 » Learning Approximate Consistencies |
188
click to vote
COLT
2006
Springer
15 years 11 months ago
2006
Springer
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
239
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Many visual search and matching systems represent images using sparse sets of "visual words": descriptors that have been quantized by assignment to the best-matching symb...
168
Voted
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
We study the problem of agents locating other agents that are both capable and willing to help complete assigned tasks. An agent incurs a fixed cost for each help request it sends...
180
click to vote
VMV
2008
15 years 8 months ago
2008
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...
191
click to vote
NIPS
2004
15 years 8 months ago
2004
We address the problem of identifying specific instances of a class (cars) from a set of images all belonging to that class. Although we cannot build a model for any particular in...