Sciweavers

870 search results - page 113 / 174
» Graph Comparison Using Fine Structure Analysis
Sort
View
INFOCOM
2005
IEEE
15 years 3 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
DAC
2001
ACM
15 years 11 months ago
Circuit-based Boolean Reasoning
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
Andreas Kuehlmann, Malay K. Ganai, Viresh Paruthi
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 10 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 1 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
TVCG
2008
140views more  TVCG 2008»
14 years 9 months ago
Efficient Morse Decompositions of Vector Fields
Vector field analysis plays a crucial role in many engineering applications, such as weather prediction, tsunami and hurricane study, and airplane and automotive design. Existing ...
Guoning Chen, Konstantin Mischaikow, Robert S. Lar...