Sciweavers

1538 search results - page 161 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
CORR
2007
Springer
128views Education» more  CORR 2007»
15 years 3 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi
IMC
2010
ACM
15 years 1 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
SODA
2012
ACM
227views Algorithms» more  SODA 2012»
13 years 6 months ago
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
François Le Gall
JMIV
2008
214views more  JMIV 2008»
15 years 3 months ago
A Network Flow Algorithm for Reconstructing Binary Images from Continuous X-rays
Tomography is a powerful technique to obtain accurate images of the interior of an object in a nondestructive way. Conventional reconstruction algorithms, such as filtered backproj...
Kees Joost Batenburg
MST
2002
169views more  MST 2002»
15 years 3 months ago
Bulk Synchronous Parallel Algorithms for the External Memory Model
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. ...