3172 search results - page 70 / 635 » On the Random-Self-Reducibility of Complete Sets |
163
click to vote
SIGIR
2006
ACM
16 years 4 days ago
2006
ACM
Modern retrieval test collections are built through a process called pooling in which only a sample of the entire document set is judged for each topic. The idea behind pooling is...
147
click to vote
COCO
1989
Springer
15 years 10 months ago
1989
Springer
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
160
click to vote
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Those programs assert code...
181
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
Nonlinear approximation has usually been studied under deterministic assumptions and complete information about the underlying functions. In the present paper we assume only partia...
173
click to vote
AMAI
2005
Springer
15 years 6 months ago
2005
Springer
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Our programs reason about t...