4229 search results - page 94 / 846 » On the Optimality of Spiral Search |
93
Voted
AIPS
2009
15 years 2 months ago
2009
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
123
click to vote
TCS
2008
15 years 1 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
165
click to vote
PROCEDIA
2011
14 years 4 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
109
click to vote
IACR
2011
14 years 26 days ago
2011
Barreto-Lynn-Scott (BLS) curves are a stand-out candidate for implementing high-security pairings. This paper shows that particular choices of the pairing-friendly search parameter...
155
click to vote
PAMI
2012
13 years 3 months ago
2012
— This paper addresses the problem of large-scale image search. Three constraints have to be taken into account: search accuracy, efficiency, and memory usage. We first present...