2004 search results - page 39 / 401 » Sampling from large graphs |
157
click to vote
VISSOFT
2005
IEEE
16 years 1 days ago
2005
IEEE
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
147
click to vote
VISAPP
2008
15 years 7 months ago
2008
Abstract. This article describes an algorithm for pose or motion estimation based on clustering of parameters in the six-dimensional pose space. The parameter samples are computed ...
161
click to vote
ISPDC
2010
IEEE
15 years 4 months ago
2010
IEEE
—Providing independent uniform samples from a system population poses considerable problems in highly dynamic settings, like P2P systems, where the number of participants and the...
208
click to vote
CVPR
2011
IEEE
15 years 1 months ago
2011
IEEE
Alpha matting refers to the problem of softly extracting the foreground from an image. Given a trimap (specifying known foreground/background and unknown pixels), a straightforwar...
160
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...