Sciweavers

151 search results - page 8 / 31
» Derandomized Squaring of Graphs
Sort
View
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 1 months ago
Detection of objects in noisy images and site percolation on square lattices
Abstract: We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algori...
Mikhail A. Langovoy, Olaf Wittich
CG
2004
Springer
13 years 6 months ago
Point cloud surfaces using geometric proximity graphs
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...
Jan Klein, Gabriel Zachmann
COMBINATORICA
2008
112views more  COMBINATORICA 2008»
13 years 6 months ago
On the rigidity of molecular graphs
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...
Bill Jackson, Tibor Jordán
ECCV
2008
Springer
14 years 5 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
13 years 6 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte