Sciweavers

692 search results - page 35 / 139
» BDD minimization for approximate computing
Sort
View
PG
2002
IEEE
15 years 3 months ago
Approximation with Active B-Spline Curves and Surfaces
An active contour model for parametric curve and surface approximation is presented. The active curve or surface adapts to the model shape to be approximated in an optimization al...
Helmut Pottmann, Stefan Leopoldseder, Michael Hofe...
FOCS
2000
IEEE
15 years 2 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
ICML
2010
IEEE
14 years 11 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
14 years 8 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
14 years 8 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie