Sciweavers

2477 search results - page 213 / 496
» Parallelizing Functional Programs by Generalization
Sort
View
187
Voted
JMLR
2006
150views more  JMLR 2006»
15 years 6 months ago
Exact 1-Norm Support Vector Machines Via Unconstrained Convex Differentiable Minimization
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...
Olvi L. Mangasarian
ASPLOS
2006
ACM
16 years 11 days ago
Combinatorial sketching for finite programs
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
Armando Solar-Lezama, Liviu Tancau, Rastislav Bod&...
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
15 years 11 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
POPL
2010
ACM
16 years 3 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
181
Voted
LPKR
1997
Springer
15 years 10 months ago
Knowledge Representation with Logic Programs
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
Gerhard Brewka, Jürgen Dix