1671 search results - page 233 / 335 » On the Covering Steiner Problem |
171
click to vote
FOCS
2009
IEEE
16 years 22 days ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
146
click to vote
NSDI
2008
15 years 8 months ago
2008
We present Hubble, a system that operates continuously to find Internet reachability problems in which routes exist to a destination but packets are unable to reach the destinatio...
188
click to vote
ICIP
2008
IEEE
16 years 7 months ago
2008
IEEE
This paper proposes a three-dimensional (3D) body scanning system that uses passive stereo vision with a robot arm. So far, the reported 3D body scanning systems employ active 3D ...
259
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
146
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...