Sciweavers

1337 search results - page 188 / 268
» Fast computation of distance estimators
Sort
View
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
14 years 9 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
IWMM
2009
Springer
130views Hardware» more  IWMM 2009»
14 years 3 months ago
A component model of spatial locality
Good spatial locality alleviates both the latency and bandwidth problem of memory by boosting the effect of prefetching and improving the utilization of cache. However, convention...
Xiaoming Gu, Ian Christopher, Tongxin Bai, Chengli...
DCOSS
2005
Springer
14 years 2 months ago
Distributed Proximity Maintenance in Ad Hoc Mobile Networks
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...
Jie Gao, Leonidas J. Guibas, An Nguyen
SP
2008
IEEE
115views Security Privacy» more  SP 2008»
13 years 9 months ago
Compromising Reflections-or-How to Read LCD Monitors around the Corner
We present a novel eavesdropping technique for spying at a distance on data that is displayed on an arbitrary computer screen, including the currently prevalent LCD monitors. Our ...
Michael Backes, Markus Dürmuth, Dominique Unr...
ICASSP
2011
IEEE
13 years 25 days ago
A novel algorithm of seeking FrFT order for speech processing
The determination of the optimal fractional Fourier transform (FrFT) order is a crucial issue for FrFT. This paper introduces a novel algorithm is proposed for the estimation of F...
Duo-jia Ma, Xiang Xie, Jingming Kuang