510 search results - page 36 / 102 » How Should We Solve Search Problems Privately |
CVPR
2007
IEEE
13 years 11 months ago
2007
IEEE
Interactively learning from a small sample of unlabeled examples is an enormously challenging task, one that often arises in vision applications. Relevance feedback and more recen...
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
ACMICEC
2003
ACM
14 years 24 days ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
ICSEA
2007
IEEE
14 years 1 months ago
2007
IEEE
Automatic test data generation helps testers to validate software against user requirements more easily. Test data can be generated from many sources; for example, experience of t...
IJCAI
2007
13 years 9 months ago
2007
Many current state-of-the-art planners rely on forward heuristic search. The success of such search typically depends on heuristic distance-to-the-goal estimates derived from the ...