480 search results - page 32 / 96 » Algorithmic tests and randomness with respect to a class of ... |
ECCV
2010
Springer
14 years 27 days ago
2010
Springer
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
ML
2007
ACM
13 years 7 months ago
2007
ACM
We offer a new formal criterion for agent-centric learning in multi-agent systems, that is, learning that maximizes one’s rewards in the presence of other agents who might also...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
Scalability of object detectors with respect to the number of classes is a very important issue for applications where many object classes need to be detected. While combining sin...
COLT
2000
Springer
13 years 12 months ago
2000
Springer
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...