Sciweavers

6110 search results - page 123 / 1222
» Approximate Computing
Sort
View
FOCS
2007
IEEE
16 years 22 days ago
On the Optimality of Planar and Geometric Approximation Schemes
We show for several planar and geometric problems that the best known approximation schemes are essentially optimal with respect to the dependence on ǫ. For example, we show that...
Dániel Marx
GIS
2003
ACM
16 years 7 months ago
Constructing a dem from grid-based data by computing intermediate contours
We present a technique for creating a digital elevation model (DEM) from grid-based contour data. The method computes new, intermediate contours in between existing isolines. Thes...
Michael B. Gousie, Wm. Randolph Franklin
AMC
2010
86views more  AMC 2010»
15 years 6 months ago
BVMs for computing Sturm-Liouville symmetric potentials
The paper deals with the numerical solution of inverse Sturm-Liouville problems with unknown potential symmetric over the interval [0, ]. The proposed method is based on the use o...
Paolo Ghelardoni, Cecilia Magherini
152
Voted
TACAS
2005
Springer
120views Algorithms» more  TACAS 2005»
15 years 12 months ago
Symbolic Test Selection Based on Approximate Analysis
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
Bertrand Jeannet, Thierry Jéron, Vlad Rusu,...
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
15 years 6 months ago
Approximation Algorithms for Treewidth
Abstract. This paper presents algorithms whose input is an undirected graph, and whose output is a tree decomposition of width that approximates the optimal, the treewidth of that ...
Eyal Amir