Sciweavers

38 search results - page 4 / 8
» Message-passing for Maximum Weight Independent Set
Sort
View
BMVC
2001
13 years 10 months ago
An EM-like Algorithm for Motion Segmentation via Eigendecomposition
This paper presents an iterative maximum likelihood framework for motion segmentation via the pairwise checking of pixel blocks. We commence from a characterisation of the motion ...
Antonio Robles-Kelly, Edwin R. Hancock
ALGORITHMICA
2002
116views more  ALGORITHMICA 2002»
13 years 7 months ago
Budget Management with Applications
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...
Chunhong Chen, Elaheh Bozorgzadeh, Ankur Srivastav...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
ICCAD
2006
IEEE
117views Hardware» more  ICCAD 2006»
14 years 4 months ago
Post-routing redundant via insertion and line end extension with via density consideration
- Redundant via insertion and line end extension employed in the post-routing stage are two well known and highly recommended techniques to reduce yield loss due to via failure. Ho...
Kuang-Yao Lee, Ting-Chi Wang, Kai-Yuan Chao
INFOCOM
2009
IEEE
14 years 2 months ago
Delay Guarantees for Throughput-Optimal Wireless Link Scheduling
—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...
Koushik Kar, Xiang Luo, Saswati Sarkar