Sciweavers

1100 search results - page 160 / 220
» Approximate distance oracles
Sort
View
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
15 years 10 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
VLDB
2004
ACM
127views Database» more  VLDB 2004»
15 years 10 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
15 years 4 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
CISS
2008
IEEE
15 years 4 months ago
Relay selection methods for wireless cooperative communications
— We study the problem of relay selection in a wireless cooperative network. Assuming a single source, a single destination, and N uniformly distributed candidate relays, we seek...
Seunghoon Nam, Mai Vu, Vahid Tarokh
INFOCOM
2007
IEEE
15 years 4 months ago
Minimum-Latency Broadcast Scheduling in Wireless Ad Hoc Networks
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
Scott C.-H. Huang, Peng-Jun Wan, Xiaohua Jia, Hong...