510 search results - page 41 / 102 » How Should We Solve Search Problems Privately |
NIPS
2001
13 years 9 months ago
2001
When constructing a classifier, the probability of correct classification of future data points should be maximized. In the current paper this desideratum is translated in a very ...
JAIR
2000
13 years 7 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
— Robot search and rescue is a time critical task, i.e. a large terrain has to be explored by multiple robots within a short amount of time. The efficiency of exploration depend...
SIGIR
2012
ACM
11 years 10 months ago
2012
ACM
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...