Sciweavers

310 search results - page 41 / 62
» Randomized Binary Search Trees
Sort
View
CVPR
2010
IEEE
13 years 12 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
CPC
2008
74views more  CPC 2008»
13 years 10 months ago
An Analysis of the Height of Tries with Random Weights on the Edges
We analyze the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . . , d}. The edges receive random weights whose distr...
Nicolas Broutin, Luc Devroye
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 4 months ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks
AINA
2008
IEEE
14 years 4 months ago
Optimal Resource Discovery Paths of Gnutella2
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
Mikko Vapa, Annemari Auvinen, Yevgeniy Ivanchenko,...
SPAA
1990
ACM
14 years 1 months ago
Optimal Cooperative Search in Fractional Cascaded Data Structures
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
Roberto Tamassia, Jeffrey Scott Vitter