Sciweavers

9477 search results - page 1642 / 1896
» Design is as Easy as Optimization
Sort
View
IPCO
2008
118views Optimization» more  IPCO 2008»
15 years 8 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
LREC
2008
84views Education» more  LREC 2008»
15 years 8 months ago
A Test Suite for Inference Involving Adjectives
Recently, most of the research in NLP has concentrated on the creation of applications coping with textual entailment. However, there still exist very few resources for the evalua...
Marilisa Amoia, Claire Gardent
IJCAI
2007
15 years 8 months ago
Kernel Conjugate Gradient for Fast Kernel Machines
We propose a novel variant of the conjugate gradient algorithm, Kernel Conjugate Gradient (KCG), designed to speed up learning for kernel machines with differentiable loss functio...
Nathan D. Ratliff, J. Andrew Bagnell
LREC
2008
174views Education» more  LREC 2008»
15 years 8 months ago
Automatic Phoneme Segmentation with Relaxed Textual Constraints
Speech synthesis by unit selection requires the segmentation of a large single speaker high quality recording. Automatic speech recognition techniques, e.g. Hidden Markov Models (...
Pierre Lanchantin, Andrew C. Morris, Xavier Rodet,...
NIPS
2008
15 years 8 months ago
Clustered Multi-Task Learning: A Convex Formulation
In multi-task learning several related tasks are considered simultaneously, with the hope that by an appropriate sharing of information across tasks, each task may benefit from th...
Laurent Jacob, Francis Bach, Jean-Philippe Vert
« Prev « First page 1642 / 1896 Last » Next »