5606 search results - page 327 / 1122 » Randomization Techniques for Graphs. |
165
click to vote
APVIS
2007
15 years 8 months ago
2007
The level-of-detail techniques presented in this paper enable a comprehensible interactive visualization of large and complex clustered graph layouts either in 2D or 3D. Implicit ...
165
click to vote
JDA
2010
15 years 1 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
198
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniqu...
173
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
187
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract – In this paper, a variational message passing framework is proposed for Markov random fields. Analogous to the traditional belief propagation algorithm, variational mes...