245 search results - page 18 / 49 » Introducing the User-over-Ranking Hypothesis |
ICML
2004
IEEE
16 years 16 days ago
2004
IEEE
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...
COCO
2004
Springer
15 years 5 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
77
Voted
ECCC
2007
14 years 11 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
ICPR
2008
IEEE
16 years 28 days ago
2008
IEEE
This paper introduces a novel stochastic approach to image denoising using an adaptive Monte Carlo scheme. Random samples are generated from the image field using a spatially-adap...
ICML
2006
IEEE
16 years 16 days ago
2006
IEEE
If appropriately used, prior knowledge can significantly improve the predictive accuracy of learning algorithms or reduce the amount of training data needed. In this paper we intr...