Sciweavers

511 search results - page 54 / 103
» TSP with bounded metrics
Sort
View
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
14 years 11 months ago
Earth mover distance over high-dimensional spaces
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
Alexandr Andoni, Piotr Indyk, Robert Krauthgamer
TMC
2012
13 years 4 days ago
Modeling and Performance Evaluation of Backoff Misbehaving Nodes in CSMA/CA Networks
—Backoff misbehavior, in which a wireless node deliberately manipulates its backoff time, can induce significant network problems, such as severe unfairness and denial-of-servic...
Zhuo Lu, Wenye Wang, Cliff Wang
IMR
2005
Springer
15 years 3 months ago
A fews snags in mesh adaptation loops
The first stage in an adaptive finite element scheme (cf. [CAS95, bor1]) consists in creating an initial mesh of a given domain Ω, which is used to perform an initial computati...
Frédéric Hecht
ICDE
2010
IEEE
188views Database» more  ICDE 2010»
15 years 9 months ago
Space-efficient Online Approximation of Time Series Data: Streams, Amnesia, and Out-of-order
In this paper, we present an abstract framework for online approximation of time-series data that yields a unified set of algorithms for several popular models: data streams, amnes...
Sorabh Gandhi, Luca Foschini, Subhash Suri
ICALP
2011
Springer
14 years 1 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...