Sciweavers

4843 search results - page 5 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
CCCG
2006
13 years 9 months ago
An Improved Approximation Factor For The Unit Disk Covering Problem
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...
Sada Narayanappa, Petr Vojtechovský
COMPSAC
2005
IEEE
14 years 1 months ago
Autonomous Hot Patching for Web-Based Applications
Patching technologies are commonly applied to improve the dependability of software after release. This paper proposes an autonomous hot patching (AHP) framework to fully automate...
Hai Huang, Wei-Tek Tsai, Yinong Chen
CDC
2009
IEEE
155views Control Systems» more  CDC 2009»
13 years 11 months ago
Efficient and robust communication topologies for distributed decision making in networked systems
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
John S. Baras, Pedram Hovareshti
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 4 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...