Sciweavers

168 search results - page 27 / 34
» On Nontrivial Approximation of CSPs
Sort
View
CORR
2010
Springer
89views Education» more  CORR 2010»
13 years 10 months ago
Distributed Control of the Laplacian Spectral Moments of a Network
It is well-known that the eigenvalue spectrum of the Laplacian matrix of a network contains valuable information about the network structure and the behavior of many dynamical proc...
Victor M. Preciado, Michael M. Zavlanos, Ali Jadba...
DC
2010
13 years 10 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
ECCC
2007
71views more  ECCC 2007»
13 years 10 months ago
Inverse Conjecture for the Gowers norm is false
Let p be a fixed prime number, and N be a large integer. The ’Inverse Conjecture for the Gowers norm’ states that if the ”d-th Gowers norm” of a function f : FN p → F i...
Shachar Lovett, Roy Meshulam, Alex Samorodnitsky
IJBC
2007
90views more  IJBC 2007»
13 years 10 months ago
Extended Phase Diagram of the Lorenz Model
The parameter dependence of the various attractive solutions of the three variable nonlinear Lorenz model equations for thermal convection in Rayleigh-B´enard flow is studied. I...
H. R. Dullin, S. Schmidt, P. H. Richter, S. K. Gro...
TAMC
2010
Springer
13 years 8 months ago
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
Pinar Heggernes, Daniel Meister, Udi Rotics