Sciweavers

3044 search results - page 33 / 609
» Linear logical approximations
Sort
View
WADS
2007
Springer
165views Algorithms» more  WADS 2007»
14 years 2 months ago
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
Matthias Müller-Hannemann, Siamak Tazari
ASPDAC
2010
ACM
119views Hardware» more  ASPDAC 2010»
13 years 6 months ago
VISA: versatile impulse structure approximation for time-domain linear macromodeling
Abstract-- We develop a rational function macromodeling algorithm named VISA (Versatile Impulse Structure Approximation) for macromodeling of system responses with (discrete) time-...
Chi-Un Lei, Ngai Wong
ICASSP
2011
IEEE
13 years 14 days ago
Linear manifold approximation based on differences of tangents
In this paper, we consider the problem of manifold approximation with affine subspaces. Our objective is to discover a set of low dimensional affine subspaces that represents ma...
Sofia Karygianni, Pascal Frossard
ALGORITHMICA
2005
95views more  ALGORITHMICA 2005»
13 years 8 months ago
Near-Linear Time Approximation Algorithms for Curve Simplification
Abstract. We consider the problem of approximating a polygonal curve
Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Must...
SPAA
2009
ACM
14 years 9 months ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...