1604 search results - page 232 / 321 » Approximation algorithms for developable surfaces |
ICCAD
1999
IEEE
14 years 1 months ago
1999
IEEE
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 ...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— Scalable and efficient routing is a main challenge in the deployment of large ad hoc wireless networks. An essential element of practical routing protocols is their accommodat...
SMA
2005
ACM
14 years 2 months ago
2005
ACM
Numerous simplification methods have been proposed for speeding up engineering analysis/ simulation. A recently proposed medial axis reduction is one such method, that is particul...
CVPR
2003
IEEE
14 years 2 months ago
2003
IEEE
A framework for analyzing distortions in non-single viewpoint imaging systems is presented. Such systems possess loci of viewpoints called caustics. In general, perspective (or un...