1173 search results - page 60 / 235 » Program Derivation Using Analogy |
130
click to vote
JMLR
2006
2006
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
15 years 2 months ago
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...
98
Voted
CMPB
2000
15 years 2 months ago
2000
A program for action potential waveform analysis based on a PC compatible computer is described. Single or averaged action potentials are analyzed by obtaining its first derivativ...
88
Voted
CORR
2010
Springer
15 years 17 days ago
2010
Springer
Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple opt...
113
Voted
WSC
2007
15 years 4 months ago
2007
This paper addresses several issues of using the mathematical programming representations of discrete-event dynamic systems in perturbation analysis. In particular, linear program...
161
click to vote
ICLP
1994
Springer
15 years 6 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...