Sciweavers

7129 search results - page 288 / 1426
» Approximation Algorithms for Treewidth
Sort
View
AAECC
2007
Springer
117views Algorithms» more  AAECC 2007»
15 years 4 months ago
A predictor-corrector-type technique for the approximate parameterization of intersection curves
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
Bert Jüttler, Pavel Chalmovianský
CORR
2010
Springer
104views Education» more  CORR 2010»
15 years 4 months ago
Approximating the minimum directed tree cover
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
Viet Hung Nguyen
CCR
2006
117views more  CCR 2006»
15 years 4 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
TIP
2008
139views more  TIP 2008»
15 years 4 months ago
Parameter Estimation in TV Image Restoration Using Variational Distribution Approximation
In this paper, we propose novel algorithms for total variation (TV) based image restoration and parameter estimation utilizing variational distribution approximations. Within the h...
S. Derin Babacan, Rafael Molina, Aggelos K. Katsag...
IPL
2002
118views more  IPL 2002»
15 years 4 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...