Sciweavers

7930 search results - page 413 / 1586
» Greedy in Approximation Algorithms
Sort
View
CAD
1998
Springer
15 years 6 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
ICDE
1996
IEEE
142views Database» more  ICDE 1996»
16 years 8 months ago
Approximate Queries and Representations for Large Data Sequences
Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation ...
Hagit Shatkay, Stanley B. Zdonik
JSCIC
2008
107views more  JSCIC 2008»
15 years 6 months ago
A Hierarchy of Approximations of the Master Equation Scaled by a Size Parameter
Solutions of the master equation are approximated using a hierarchy of models based on the solution of ordinary differential equations: the macroscopic equations, the linear noise...
Lars Ferm, Per Lötstedt, Andreas Hellander
CORR
2011
Springer
165views Education» more  CORR 2011»
15 years 1 months ago
Causal Dependence Tree Approximations of Joint Distributions for Multiple Random Processes
—We investigate approximating joint distributions of random processes with causal dependence tree distributions. Such distributions are particularly useful in providing parsimoni...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
197
Voted
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
15 years 8 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre