Sciweavers

102 search results - page 16 / 21
» Distributed Approximation Algorithms for Weighted Problems i...
Sort
View
SPAA
2005
ACM
14 years 1 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
PODC
2005
ACM
14 years 1 months ago
Quorum placement in networks to minimize access delays
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
Anupam Gupta, Bruce M. Maggs, Florian Oprea, Micha...
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 7 months ago
Fast space-variant elliptical filtering using box splines
The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is po...
Kunal Narayan Chaudhury, Arrate Muñoz-Barru...
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 8 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
14 years 7 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter