239 search results - page 4 / 48 » Some Results on Greedy Embeddings in Metric Spaces |
STOC
2003
ACM
15 years 9 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
SBBD
2004
14 years 10 months ago
2004
In order to index text fields in XML databases for similarity queries, M-Trees may be applied. However, some datasets experiments using M-Trees for this purpose resulted in low qu...
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
—We study scalable routing for a sensor network deployed in complicated 3D settings such as underground tunnels in gas system or water system. The nodes are in general 3D space b...
85
Voted
ALENEX
2010
14 years 11 months ago
2010
Small-world experiments in which packages reach addressees unknown to the original sender through a forwarding chain confirm that acquaintance networks have short paths, a propert...
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— We propose a scalable and reliable point-topoint routing algorithm for ad hoc wireless networks and sensornets. Our algorithm assigns to each node of the network a virt...