Sciweavers

3991 search results - page 200 / 799
» Bounding homogeneous models
Sort
View
ICCV
2011
IEEE
12 years 8 months ago
The Truth about Cats and Dogs
Template-based object detectors such as the deformable parts model of Felzenszwalb et al. [11] achieve state-ofthe-art performance for a variety of object categories, but are stil...
Omkar M Parkhi, Andrea Vedaldi, C. V. Jawahar, And...
RSA
2006
104views more  RSA 2006»
13 years 8 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Alan M. Frieze, Michael Molloy
KI
2008
Springer
13 years 8 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson
IPL
2010
92views more  IPL 2010»
13 years 6 months ago
Learning parities in the mistake-bound model
We study the problem of learning parity functions that depend on at most k variables (kparities) attribute-efficiently in the mistake-bound model. We design a simple, deterministi...
Harry Buhrman, David García-Soriano, Arie M...
EUROCOLT
1999
Springer
14 years 16 days ago
Mind Change Complexity of Learning Logic Programs
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Sanjay Jain, Arun Sharma