352 search results - page 53 / 71 » Partitioning Graphs into Connected Parts |
195
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
ICPR
2006
IEEE
16 years 25 days ago
2006
IEEE
There are different approaches to pose estimation and registration of different body parts using voxel data. We propose a general bottom-up approach in order to segment the voxels...
142
click to vote
CPAIOR
2010
Springer
14 years 9 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
100
click to vote
STOC
2009
ACM
16 years 10 days ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...