3220 search results - page 124 / 644 » Constrained Graph Processes |
RSA
2006
14 years 10 months ago
2006
: Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a, and b be vertices. An earlier paper (J. Van den Berg and J. Kahn, Ann Probab 29 (2001), 1...
DIAGRAMS
2006
Springer
15 years 1 months ago
2006
Springer
We argue that a comprehensive model of graph comprehension must include spatial cognition. We propose that current models of graph comprehension have not needed to incorporate spat...
ICIP
2008
IEEE
15 years 4 months ago
2008
IEEE
Openings-by-reconstruction are the oldest connected filters, and indeed, reconstruction methodology lies at the heart of many connected operators such as levelings. Starting out ...
101
click to vote
APAQS
2001
IEEE
15 years 1 months ago
2001
IEEE
Code-patterns are statically recurring structure specific to a programming language. It can be parallel to aid in designing software systems for solving particular problems. Contr...
DASFAA
2007
IEEE
15 years 4 months ago
2007
IEEE
The study of the Web graph not only yields valuable insight into Web algorithms for crawling, searching and community discovery, and the sociological phenomena that characterize it...