Sciweavers

85 search results - page 9 / 17
» Error Explanation with Distance Metrics
Sort
View
FOCS
2004
IEEE
14 years 9 days ago
Triangulation and Embedding Using Small Sets of Beacons
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler
DAM
2008
68views more  DAM 2008»
13 years 8 months ago
Multiple packing in sum-type metric spaces
We present the exact solution of the asymptotics of the multiple packing problem in a finite space with a sum-type metric. 1 Consider the space Qn of n-tuples over a finite set Q ...
Rudolf Ahlswede, Vladimir Blinovsky
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
14 years 2 months ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan
IMC
2005
ACM
14 years 2 months ago
On the Accuracy of Embeddings for Internet Coordinate Systems
Internet coordinate systems embed Round-Trip-Times (RTTs) between Internet nodes into some geometric space so that unmeasured RTTs can be estimated using distance computation in t...
Eng Keong Lua, Timothy G. Griffin, Marcelo Pias, H...
SI3D
2003
ACM
14 years 1 months ago
Interruptible rendering
Interruptible rendering is a novel approach to the fidelity-versusperformance tradeoff ubiquitous in real-time rendering. Interruptible rendering unifies spatial error, caused by ...
Cliff Woolley, David P. Luebke, Benjamin Watson, A...