Sciweavers

7150 search results - page 184 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
16 years 18 days ago
Approximating the Crossing Number of Toroidal Graphs
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
Petr Hlinený, Gelasio Salazar
SODA
1992
ACM
179views Algorithms» more  SODA 1992»
15 years 7 months ago
Approximating the Minimum Weight Triangulation
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
David Eppstein
APPROX
2009
Springer
131views Algorithms» more  APPROX 2009»
16 years 1 months ago
An Approximation Scheme for Terrain Guarding
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R....
AUTOMATICA
2004
122views more  AUTOMATICA 2004»
15 years 6 months ago
Approximate explicit receding horizon control of constrained nonlinear systems
An algorithm for the construction of an explicit piecewise linear state feedback approximation to nonlinear constrained receding horizon control is given. It allows such controlle...
Tor Arne Johansen
ICDAR
2009
IEEE
15 years 4 months ago
Bayesian Similarity Model Estimation for Approximate Recognized Text Search
Approximate text search is a basic technique to handle recognized text that contains recognition errors. This paper proposes an approximate string search for recognized text using...
Atsuhiro Takasu