Sciweavers

184 search results - page 20 / 37
» Near Neighbor Search in Large Metric Spaces
Sort
View
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
15 years 1 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
66
Voted
ICCV
2009
IEEE
1019views Computer Vision» more  ICCV 2009»
16 years 2 months ago
Similarity Functions for Categorization: from Monolithic to Category Specific
Similarity metrics that are learned from labeled training data can be advantageous in terms of performance and/or efficiency. These learned metrics can then be used in conjuncti...
Boris Babenko, Steve Branson, Serge Belongie
COMPGEOM
2004
ACM
15 years 3 months ago
Locality-sensitive hashing scheme based on p-stable distributions
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...
ICDCS
1999
IEEE
15 years 1 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
ICDAR
2011
IEEE
13 years 9 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein