210 search results - page 2 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
ALT
2010
Springer
13 years 6 months ago
2010
Springer
We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...
ALT
2010
Springer
13 years 6 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
AI
2007
Springer
13 years 5 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
Abstract. We propose a novel and efficient method for generic arbitraryview object class detection and localization. In contrast to existing singleview and multi-view methods using...