Sciweavers

1722 search results - page 129 / 345
» On the sample mean of graphs
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
FOCS
2006
IEEE
16 years 12 days ago
A simple condition implying rapid mixing of single-site dynamics on spin systems
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
Thomas P. Hayes
DILS
2004
Springer
15 years 11 months ago
Links and Paths through Life Sciences Data Sources
An abundance of biological data sources contain data on classes of scientific entities, such as genes and sequences. Logical relationships between scientific objects are implemen...
Zoé Lacroix, Hyma Murthy, Felix Naumann, Lo...
CVPR
2000
IEEE
15 years 10 months ago
Learning Patterns from Images by Combining Soft Decisions and Hard Decisions
We present a novel approach for learning patterns (sub-images) shared by multiple images without prior knowledge about the number and the positions of the patterns in the images. ...
Pengyu Hong, Thomas S. Huang, Roy Wang
ISCAS
1999
IEEE
95views Hardware» more  ISCAS 1999»
15 years 10 months ago
Evaluating iterative improvement heuristics for bigraph crossing minimization
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
Matthias F. M. Stallmann, Franc Brglez, Debabrata ...