Sciweavers

727 search results - page 79 / 146
» Private approximation of search problems
Sort
View
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 10 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
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
14 years 1 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
ICDM
2009
IEEE
141views Data Mining» more  ICDM 2009»
14 years 4 months ago
Scalable Algorithms for Distribution Search
Distribution data naturally arise in countless domains, such as meteorology, biology, geology, industry and economics. However, relatively little attention has been paid to data m...
Yasuko Matsubara, Yasushi Sakurai, Masatoshi Yoshi...
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 10 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
WABI
2007
Springer
102views Bioinformatics» more  WABI 2007»
14 years 4 months ago
Homology Search with Fragmented Nucleic Acid Sequence Patterns
The comprehensive annotation of non-coding RNAs in newly sequenced genomes is still a largely unsolved problem because many functional RNAs exhibit not only poorly conserved sequen...
Axel Mosig, Julian J.-L. Chen, Peter F. Stadler