16 search results - page 3 / 4 » A Sublinear-Time Randomized Approximation Scheme for the Rob... |
SIGMETRICS
2010
ACM
13 years 7 months ago
2010
ACM
Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...
ICALP
2004
Springer
14 years 23 days ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
EOR
2010
13 years 7 months ago
2010
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
— We propose to classify the behaviors of a mobile robot thanks to topological methods as an alternative to metric ones. To do so, we adapt an analysis scheme from Physics of non...