3055 search results - page 391 / 611 » Randomized Search Trees |
130
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
120
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
For noisy optimization problems, there is generally a trade-off between the effort spent to reduce the noise (in order to allow the optimization algorithm to run properly), and t...
116
click to vote
SIGIR
2010
ACM
15 years 7 months ago
2010
ACM
It has been observed that precision increases with collection size. One explanation could be that the redundancy of information increases, making it easier to find multiple docum...
135
Voted
WSC
2008
15 years 6 months ago
2008
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
146
click to vote
FPL
2008
Springer
15 years 5 months ago
2008
Springer
This paper presents a new approach for mapping task graphs to heterogeneous hardware/software computing systems using heuristic search techniques. Two techniques: (1) integration ...