Sciweavers

35 search results - page 7 / 7
» Rescuing our families, our neighbors, and ourselves
Sort
View
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 5 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
EDBT
2008
ACM
169views Database» more  EDBT 2008»
14 years 5 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
JSAC
2007
153views more  JSAC 2007»
13 years 5 months ago
Cooperative Relay Service in a Wireless LAN
As a family of wireless local area network (WLAN) protocols between physical layer and higher layer protocols, IEEE 802.11 has to accommodate the features and requirements of both...
Lei Guo, Xiaoning Ding, Haining Wang, Qun Li, Song...
PAMI
2007
154views more  PAMI 2007»
13 years 4 months ago
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
CORR
2011
Springer
217views Education» more  CORR 2011»
12 years 9 months ago
Coarse-Grained Topology Estimation via Graph Sampling
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this a...
Maciej Kurant, Minas Gjoka, Yan Wang, Zack W. Almq...