Sciweavers

87 search results - page 1 / 18
» Limits of dense graph sequences
Sort
View
JCT
2006
48views more  JCT 2006»
13 years 4 months ago
Limits of dense graph sequences
László Lovász, Balázs ...
COMBINATORICS
1998
64views more  COMBINATORICS 1998»
13 years 4 months ago
Another Infinite Sequence of Dense Triangle-Free Graphs
Stephan Brandt, Tomaz Pisanski
CVPR
2003
IEEE
14 years 6 months ago
Extracting Dense Features for Visual Correspondence with Graph Cuts
We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted dur...
Olga Veksler
CPM
2004
Springer
168views Combinatorics» more  CPM 2004»
13 years 10 months ago
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robe...
CORR
2010
Springer
166views Education» more  CORR 2010»
13 years 4 months ago
The dynamics of message passing on dense graphs, with applications to compressed sensing
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
Mohsen Bayati, Andrea Montanari