2272 search results - page 105 / 455 » Capture Complexity by Partition |
SIAMDM
2008
14 years 9 months ago
2008
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...
107
click to vote
WAW
2010
Springer
14 years 7 months ago
2010
Springer
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
106
click to vote
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract-- We study the convergence rate of average consensus algorithms in networks with stochastic communication failures. We show how the system dynamics can be modeled by a dis...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
Image-based rendering (IBR) systems create photorealistic views of complex 3D environments by resampling large collections of images captured in the environment. The quality of th...