215 search results - page 27 / 43 » Approximating Geometrical Graphs via |
STOC
2002
ACM
14 years 10 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
AUTOMATICA
2004
13 years 9 months ago
2004
A fundamental problem in the simulation and control of complex physical systems containing distributed-parameter components concerns finite-dimensional approximation. Numerical me...
CG
2011
Springer
13 years 4 months ago
2011
Springer
TON: Curve Network Abstraction for 3D Shapes Fernando de Goesa,∗ , Siome Goldensteinb , Mathieu Desbruna , Luiz Velhoc aCalifornia Institute of Technology, Pasadena, CA 91125, US...
DGCI
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...