Sciweavers

24 search results - page 2 / 5
» Similarity Search in Arbitrary Subspaces Under Lp-Norm
Sort
View
CVPR
2007
IEEE
14 years 6 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
EDBT
2009
ACM
156views Database» more  EDBT 2009»
13 years 8 months ago
Efficient skyline retrieval with arbitrary similarity measures
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...
Deepak P, Prasad M. Deshpande, Debapriyo Majumdar,...
PODS
2008
ACM
211views Database» more  PODS 2008»
14 years 5 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
IPPS
2007
IEEE
13 years 11 months ago
A Landmark-based Index Architecture for General Similarity Search in Peer-to-Peer Networks
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
Xiaoyu Yang, Yiming Hu
RECOMB
2002
Springer
14 years 5 months ago
Provably sensitive Indexing strategies for biosequence similarity search
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
Jeremy Buhler