1542 search results - page 220 / 309 » The metamathematics of random graphs |
113
click to vote
CVPR
2010
IEEE
15 years 10 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...
108
click to vote
EMMCVPR
2001
Springer
15 years 6 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...
126
click to vote
COMPLEX
2009
Springer
15 years 5 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...
118
click to vote
COCOON
2008
Springer
15 years 3 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...
136
Voted
AAAI
2010
15 years 3 months ago
2010
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...