1619 search results - page 231 / 324 » Structure in the Space of Value Functions |
155
Voted
P2P
2007
IEEE
16 years 8 days ago
2007
IEEE
There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are ...
226
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
179
click to vote
ICS
2010
Tsinghua U.
16 years 3 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
179
click to vote
SISAP
2009
IEEE
16 years 22 days ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
171
click to vote
CPAIOR
2008
Springer
15 years 7 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...