727 search results - page 111 / 146 » Private approximation of search problems |
206
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a...
DATE
2010
IEEE
15 years 4 months ago
2010
IEEE
—With the prospect of atomic-scale computing, we study cumulative energy profiles of spin-spin interactions in nonferromagnetic lattices (Ising spin-glasses)—an established to...
AIPS
2008
15 years 2 months ago
2008
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
113
Voted
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
JMLR
2010
14 years 6 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...