288 search results - page 19 / 58 » Notes on computing minimal approximant bases |
AI
2008
Springer
13 years 10 months ago
2008
Springer
Verification of reachability properties for probabilistic systems is usually based on variants of Markov processes. Current methods assume an exact model of the dynamic behavior a...
CVPR
2009
IEEE
14 years 1 months ago
2009
IEEE
Nonnegative Matrix Factorization (NMF) approximates a given data matrix as a product of two low rank nonnegative matrices, usually by minimizing the L2 or the KL distance between ...
RECOMB
1997
Springer
14 years 2 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
ACCV
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Image matting and segmentation are two closely related topics that concern extracting the foreground and background of an image. While the methods based on global optimiz...
CAD
2004
Springer
13 years 9 months ago
2004
Springer
Pottmann et al. propose an iterative optimization scheme for approximating a target curve with a B-spline curve based on square distance minimization, or SDM. The main advantage o...