Sciweavers

1388 search results - page 90 / 278
» Approximability of Robust Network Design
Sort
View
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
14 years 10 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale
CAV
2010
Springer
227views Hardware» more  CAV 2010»
13 years 7 months ago
Breach, A Toolbox for Verification and Parameter Synthesis of Hybrid Systems
We describe Breach, a Matlab toolbox providing a coherent set of simulation-based techniques aimed at the analysis of deterministic models of hybrid dynamical systems. The primary ...
Alexandre Donzé
JMIV
2010
107views more  JMIV 2010»
13 years 4 months ago
Block Based Deconvolution Algorithm Using Spline Wavelet Packets
This paper proposes robust algorithms to deconvolve discrete noised signals and images. The solutions are derived as linear combinations of spline wavelet packets that minimize so...
Amir Averbuch, Valery A. Zheludev, Pekka Neittaanm...
CISS
2008
IEEE
14 years 4 months ago
Optimizing wireless networks for heterogeneous spatial loads
—Large-scale wireless networks must be designed such that there are no gaps in coverage. It is also desirable to minimize the number of access points used in order to minimize th...
Balaji Rengarajan, Gustavo de Veciana
CJ
2010
128views more  CJ 2010»
13 years 9 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...