Sciweavers

3096 search results - page 125 / 620
» The Generalized FITC Approximation
Sort
View
WADS
2007
Springer
128views Algorithms» more  WADS 2007»
14 years 3 months ago
Approximate Range Searching: The Absolute Model
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
Guilherme Dias da Fonseca
FOCS
2006
IEEE
14 years 2 months ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
CDC
2009
IEEE
134views Control Systems» more  CDC 2009»
14 years 1 months ago
Event-based control using quadratic approximate value functions
Abstract— In this paper we consider several problems involving control with limited actuation and sampling rates. Event-based control has emerged as an attractive approach for ad...
Randy Cogill
OA
1989
237views Algorithms» more  OA 1989»
14 years 28 days ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
MST
2010
187views more  MST 2010»
13 years 3 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda