4324 search results - page 164 / 865 » A Generalized Representer Theorem |
157
Voted
COMBINATORICS
1998
15 years 4 months ago
1998
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...
128
click to vote
GECCO
2000
Springer
15 years 8 months ago
2000
Springer
A general variable length genome, called exG, is developed here to address the problems of fixed length representations in canonical evolutionary algorithms. Convergence aspects o...
144
click to vote
PODS
2004
ACM
16 years 4 months ago
2004
ACM
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...
179
click to vote
ICFP
2006
ACM
16 years 4 months ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
110
click to vote
CIE
2007
Springer
15 years 11 months ago
2007
Springer
The interest is in characterizing insightfully the power of program self-reference in effective programming systems (epses), the computability-theoretic analogs of programming lan...