1949 search results - page 260 / 390 » Random graphs on surfaces |
147
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
136
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
106
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...
145
click to vote
CVPR
2010
IEEE
16 years 21 days 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...
127
click to vote
EMMCVPR
2001
Springer
15 years 8 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...