220 search results - page 9 / 44 » Distributed Minimum Cut Approximation |
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
MOBIHOC
2002
ACM
14 years 9 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
ISPD
2009
ACM
14 years 4 months ago
2009
ACM
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
ACIVS
2007
Springer
14 years 4 months ago
2007
Springer
This paper presents a new method to both track and segment objects in videos. It includes predictions and observations inside an energy function that is minimized with graph cuts. ...
IPL
2007
13 years 9 months ago
2007
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...