Sciweavers

3019 search results - page 77 / 604
» Approximating the Domatic Number
Sort
View
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
16 years 5 days ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
15 years 5 months ago
Communication-Aware Processor Allocation for Supercomputers
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
Michael A. Bender, David P. Bunde, Erik D. Demaine...
IJCAI
2007
15 years 1 months ago
Collapsed Variational Dirichlet Process Mixture Models
Nonparametric Bayesian mixture models, in particular Dirichlet process (DP) mixture models, have shown great promise for density estimation and data clustering. Given the size of ...
Kenichi Kurihara, Max Welling, Yee Whye Teh
TALG
2010
109views more  TALG 2010»
14 years 10 months ago
Facility location with hierarchical facility costs
We introduce a facility location problem with submodular facility cost functions, and give an O(log n) approximation algorithm for it. Then we focus on a special case of submodula...
Zoya Svitkina, Éva Tardos
ALGOSENSORS
2009
Springer
15 years 6 months ago
Approximating Barrier Resilience in Wireless Sensor Networks
Barrier coverage in a sensor network has the goal of ensuring that all paths through the surveillance domain joining points in some start region S to some target region T will inte...
Sergey Bereg, David G. Kirkpatrick