Sciweavers

575 search results - page 14 / 115
» A Spectral Approach to Lower Bounds
Sort
View
CPAIOR
2005
Springer
14 years 28 days ago
Filtering Algorithms for the NValue Constraint
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
Christian Bessière, Emmanuel Hebrard, Brahi...
ICC
2007
IEEE
125views Communications» more  ICC 2007»
14 years 1 months ago
Scalable Fault Diagnosis in IP Networks using Graphical Models: A Variational Inference Approach
In this paper we investigate the fault diagnosis problem in IP networks. We provide a lower bound on the average number of probes per edge using variational inference technique pro...
Rajesh Narasimha, Souvik Dihidar, Chuanyi Ji, Stev...
ENDM
2008
101views more  ENDM 2008»
13 years 7 months ago
A central approach to bound the number of crossings in a generalized configuration
A generalized configuration is a set of n points and n 2 pseudolines such that each pseudoline passes through exactly two points, two pseudolines intersect exactly once, and no th...
Bernardo M. Ábrego, Silvia Fernández...
HYBRID
2007
Springer
14 years 1 months ago
Approximation of the Joint Spectral Radius of a Set of Matrices Using Sum of Squares
We provide an asymptotically tight, computationally efficient approximation of the joint spectral radius of a set of matrices using sum of squares (SOS) programming. The approach i...
Pablo A. Parrilo, Ali Jadbabaie
APPROX
2007
Springer
80views Algorithms» more  APPROX 2007»
13 years 11 months ago
Coarse Differentiation and Multi-flows in Planar Graphs
We show that the multi-commodity max-flow/min-cut gap for series-parallel graphs can be as bad as 2, matching a recent upper bound [8] for this class, and resolving one side of a ...
James R. Lee, Prasad Raghavendra