Sciweavers

1105 search results - page 167 / 221
» Linear choosability of graphs
Sort
View
ICCAD
2007
IEEE
161views Hardware» more  ICCAD 2007»
15 years 8 months ago
Clustering based pruning for statistical criticality computation under process variations
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
Hushrav Mogal, Haifeng Qian, Sachin S. Sapatnekar,...
CVPR
2010
IEEE
15 years 8 months ago
Discrete minimum ratio curves and surfaces
Graph cuts have proven useful for image segmentation and for volumetric reconstruction in multiple view stereo. However, solutions are biased: the cost function tends to favour ei...
Fred Nicolls, Phil Torr
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
15 years 6 months ago
Distributed motion constraints for algebraic connectivity of robotic networks
— This paper studies connectivity maintenance of robotic networks that communicate at discrete times and move in continuous space. We propose a distributed algorithm that allows ...
Michael Schuresko, Jorge Cortés
ICMCS
2007
IEEE
128views Multimedia» more  ICMCS 2007»
15 years 6 months ago
Interactive Visualization Tool with Graphic Table of Video Contents
We present an interactive visualization, called Table Of Video Contents (TOVC), for browsing structured TV programs such as news, magazines or sports. In these telecasts, getting ...
Hervé Goeau, Jérôme Thiè...
CVPR
2010
IEEE
15 years 6 months ago
One-Shot Multi-Set Non-rigid Feature-Spatial Matching
We introduce a novel framework for nonrigid feature matching among multiple sets in a way that takes into consideration both the feature descriptor and the features spatial arra...
Marwan Torki and Ahmed Elgammal