2079 search results - page 266 / 416 » Universality of random graphs |
109
click to vote
DAC
2009
ACM
16 years 5 months ago
2009
ACM
In this study, we apply a novel synthesis technique for implementing robust digital computation in nanoscale lattices with random interconnects: percolation theory on random graph...
147
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
Many feature detection algorithms rely on the choice of scale. In this paper, we complement standard scaleselection algorithms with spatial regularization. To this end, we formula...
132
click to vote
EMMCVPR
2001
Springer
15 years 9 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
153
click to vote
COMPLEX
2009
Springer
15 years 8 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
141
click to vote
COCOON
2008
Springer
15 years 6 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...