209 search results - page 16 / 42 » t-Spanners for metric space searching |
108
click to vote
CCGRID
2004
IEEE
15 years 1 months ago
2004
IEEE
Recently Peer-to-Peer networks (P2P) have gained great attention and popularity. One key challenging aspect in a P2P resource sharing environment is an efficient searching algorit...
SAC
2006
ACM
15 years 3 months ago
2006
ACM
We consider the problem of partitioning, in a highly accurate and highly efficient way, a set of n documents lying in a metric space into k non-overlapping clusters. We augment th...
ADHOCNOW
2003
Springer
15 years 3 months ago
2003
Springer
We introduce Space-Time Routing (STR), a new approach to routing in mobile ad hoc networks. In STR, the age of routing state is considered jointly with the distance to the destinat...
ECML
2006
Springer
15 years 1 months ago
2006
Springer
A critical problem in clustering research is the definition of a proper metric to measure distances between points. Semi-supervised clustering uses the information provided by the ...
ICCV
2007
IEEE
15 years 12 months ago
2007
IEEE
We present a practical, stratified autocalibration algorithm with theoretical guarantees of global optimality. Given a projective reconstruction, the first stage of the algorithm ...