Sciweavers

6110 search results - page 63 / 1222
» Approximate Computing
Sort
View
MFCS
2004
Springer
15 years 10 months ago
Polynomial Time Approximation Schemes and Parameterized Complexity
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
IDC
2009
Springer
15 years 9 months ago
Fusing Approximate Knowledge from Distributed Sources
Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Sz...
CAD
1998
Springer
15 years 4 months ago
Approximation of developable surfaces with cone spline surfaces
Developable surfaces are modelled with pieces of right circular cones. These cone spline surfaces are well-suited for applications: They possess degree two parametric and implicit...
Stefan Leopoldseder, Helmut Pottmann
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 4 months ago
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
Paul Christiano, Jonathan A. Kelner, Aleksander Ma...
FOCS
1995
IEEE
15 years 8 months ago
An Approximation Scheme for Planar Graph TSP
We consider the special case of the traveling salesman problem TSP in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial...
Michelangelo Grigni, Elias Koutsoupias, Christos H...