5606 search results - page 409 / 1122 » Randomization Techniques for Graphs. |
271
click to vote
IWPEC
2010
Springer
15 years 4 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
176
Voted
STOC
2007
ACM
16 years 7 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...
173
click to vote
ICIP
2009
IEEE
16 years 7 months ago
2009
IEEE
In this paper, a video stabilization technique is presented. There are four steps in the proposed approach. We begin with extracting feature points from the input image using the ...
173
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...
268
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
In this paper, a novel hierarchical clustering method using link analysis techniques is introduced. The algorithm is formulated as an authority seeking procedure on graphs, which c...