Sciweavers

325 search results - page 36 / 65
» Quadratic Programming Feature Selection
Sort
View
EOR
2008
133views more  EOR 2008»
14 years 12 months ago
Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
Constrained Optimization Problems (COP) often take place in many practical applications such as kinematics, chemical process optimization, power systems and so on. These problems ...
Chandra Sekhar Pedamallu, Linet Özdamar
JMLR
2010
155views more  JMLR 2010»
14 years 10 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...
SOSYM
2010
124views more  SOSYM 2010»
14 years 10 months ago
Lifting transformational models of product lines: a case study
Model driven development (MDD) of software product lines (SPLs) merges two increasing important paradigms that synthesize programs by transformation. MDD creates programs by transf...
Greg Freeman, Don S. Batory, R. Greg Lavender, Jac...
POPL
2007
ACM
16 years 3 days ago
Scrap your boilerplate with XPath-like combinators
XML programming involves idioms for expressing `structure shyness' such as the descendant axis of XPath or the default templates of XSLT. We initiate a discussion of the rela...
Ralf Lämmel
VLDB
2001
ACM
143views Database» more  VLDB 2001»
15 years 4 months ago
Supervised Wrapper Generation with Lixto
We illustrate basic features of the Lixto wrapper generator such as the user and system interaction, the capacious visual interface, the marking and selecting procedures, and the ...
Robert Baumgartner, Sergio Flesca, Georg Gottlob