Sciweavers

1573 search results - page 138 / 315
» A Data Structure for Sponsored Search
Sort
View
DAGSTUHL
2007
13 years 10 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Bodo Manthey, Till Tantau
ISBI
2007
IEEE
14 years 3 months ago
Prospecting for Live Cell Bioimaging Probes with Cheminformatic Assisted Image Array (caia)
Cheminformatic Assisted Image Array (CAIA) is a data mining and visualization tool linking chemical structures to microscope images of cells incubated with prospective bioimaging ...
Maria M. Posada, Kerby Shedden, Young Tae Chang, Q...
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 9 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
GIS
2006
ACM
14 years 10 months ago
Efficient position-independent iconic search using an R-theta index
An iconic image database is a collection of symbolic images where each image is a collection of labeled point features called icons. A method is presented to support fast position...
Charles Ben Cranston, Hanan Samet
ECCV
2002
Springer
14 years 11 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel