Sciweavers

361 search results - page 61 / 73
» Relaxed Gabriel Graphs
Sort
View
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
14 years 1 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 4 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
ICCV
2009
IEEE
15 years 2 months ago
Image Segmentation with A Bounding Box Prior
User-provided object bounding box is a simple and popular interaction paradigm considered by many existing interactive image segmentation frameworks. However, these frameworks t...
Victor Lempitsky, Pushmeet Kohli, Carsten Rother, ...
CVPR
2008
IEEE
14 years 11 months ago
Interactive image matting for multiple layers
Image matting deals with finding the probability that each pixel in an image belongs to a user specified `object' or to the remaining `background'. Most existing methods...
Dheeraj Singaraju, René Vidal
ICCAD
2003
IEEE
154views Hardware» more  ICCAD 2003»
14 years 6 months ago
Length-Matching Routing for High-Speed Printed Circuit Boards
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...
Muhammet Mustafa Ozdal, Martin D. F. Wong