Sciweavers

2157 search results - page 230 / 432
» Optimal Fast Hashing
Sort
View
113
Voted
AIPS
2009
15 years 4 months ago
Structural-Pattern Databases
abstraction heuristics, notably pattern-database and merge-and-shrink heuristics, are employed by some state-ofthe-art optimal heuristic-search planners. The major limitation of t...
Michael Katz, Carmel Domshlak
198
Voted
PPNA
2011
14 years 10 months ago
LiquidStream - network dependent dynamic P2P live streaming
A successful P2P live streaming system must achieve high uploading bandwidth utilization, fast stream distribution, fair aggregate bandwidth distribution among participating nodes,...
Nikolaos Efthymiopoulos, Athanasios Christakidis, ...
WWW
2005
ACM
16 years 4 months ago
LSH forest: self-tuning indexes for similarity search
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
Mayank Bawa, Tyson Condie, Prasanna Ganesan
250
Voted
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 3 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
BIBM
2009
IEEE
206views Bioinformatics» more  BIBM 2009»
15 years 10 months ago
Application of Kernel Functions for Accurate Similarity Search in Large Chemical Databases
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
Xiaohong Wang, Jun Huan, Aaron M. Smalter, Gerald ...