Sciweavers

1717 search results - page 245 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 2 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
JAR
2006
236views more  JAR 2006»
14 years 10 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
MA
2010
Springer
172views Communications» more  MA 2010»
14 years 8 months ago
On Monte Carlo methods for Bayesian multivariate regression models with heavy-tailed errors
We consider Bayesian analysis of data from multivariate linear regression models whose errors have a distribution that is a scale mixture of normals. Such models are used to analy...
Vivekananda Roy, James P. Hobert
MST
2010
187views more  MST 2010»
14 years 4 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
PAMI
2011
14 years 23 days ago
The Effect of Border Noise on the Performance of Projection-Based Page Segmentation Methods
— Projection methods have been used in the analysis of bi-tonal document images for different tasks like page segmentation and skew correction for over two decades. However, thes...
Faisal Shafait, Thomas M. Breuel