Sciweavers

239 search results - page 10 / 48
» Some Results on Greedy Embeddings in Metric Spaces
Sort
View
ENTCS
2008
67views more  ENTCS 2008»
14 years 9 months ago
Notions of Probabilistic Computability on Represented Spaces
: We define and compare several probabilistic notions of computability for mappings from represented spaces (that are equipped with a measure or outer measure) into computable metr...
Volker Bosserhoff
SISAP
2008
IEEE
153views Data Mining» more  SISAP 2008»
15 years 3 months ago
Counting Distance Permutations
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
Matthew Skala
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
15 years 9 months ago
Buffer overflow management in QoS switches
Abstract. We consider two types of buffering policies that are used in network switches supporting Quality of Service (QoS). In the FIFO type, packets must be transmitted in the or...
Alexander Kesselman, Zvi Lotker, Yishay Mansour, B...
IMC
2005
ACM
15 years 3 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...
ESA
2007
Springer
92views Algorithms» more  ESA 2007»
15 years 3 months ago
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
Abstract. The small world phenomenon, a.k.a. the six degree of separation between individuals, was identified by Stanley Milgram at the end of the 60s. Milgram experiment demonstr...
Pierre Fraigniaud