Sciweavers

5169 search results - page 137 / 1034
» Locality approximation using time
Sort
View
155
Voted
CIKM
2006
Springer
15 years 8 months ago
Approximate reverse k-nearest neighbor queries in general metric spaces
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
Elke Achtert, Christian Böhm, Peer Kröge...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 6 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
ICASSP
2008
IEEE
15 years 11 months ago
Stability analysis of the consensus-based distributed LMS algorithm
We deal with consensus-based online estimation and tracking of (non-) stationary signals using ad hoc wireless sensor networks (WSNs). A distributed (D-) least-mean square (LMS) l...
Ioannis D. Schizas, Gonzalo Mateos, Georgios B. Gi...
DATE
2007
IEEE
126views Hardware» more  DATE 2007»
15 years 11 months ago
WAVSTAN: waveform based variational static timing analysis
— We present a waveform based variational static timing analysis methodology. It is a timing paradigm that lies midway between convention static delay approximations and full dyn...
Saurabh K. Tiwary, Joel R. Phillips
CORR
2007
Springer
109views Education» more  CORR 2007»
15 years 4 months ago
Multiresolution Approximation of Polygonal Curves in Linear Complexity
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
Pierre-Francois Marteau, Gildas Ménier