Sciweavers

1357 search results - page 166 / 272
» Compositional analysis for linear systems
Sort
View
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
15 years 10 months 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
93
Voted
RTSS
2006
IEEE
15 years 4 months ago
Distributed Real-Time Detection and Tracking of Homogeneous Regions in Sensor Networks
In many applications we can deploy large number of sensors spanning wide geographical areas, to monitor environmental phenomena. The analysis of the data collected by such sensor ...
Sharmila Subramaniam, Vana Kalogeraki, Themis Palp...
LPAR
2010
Springer
14 years 8 months ago
Interpolating Quantifier-Free Presburger Arithmetic
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
Daniel Kroening, Jérôme Leroux, Phili...
STOC
1990
ACM
95views Algorithms» more  STOC 1990»
15 years 2 months ago
Separators in Two and Three Dimensions
a 3-dimensions a separator size where is the ber of 3-simplexes in and is the number of ization of the separator results for planar graphs, such as the and Tarjan planar separator...
Gary L. Miller, William P. Thurston
CORR
2010
Springer
166views Education» more  CORR 2010»
14 years 10 months ago
The dynamics of message passing on dense graphs, with applications to compressed sensing
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
Mohsen Bayati, Andrea Montanari