Sciweavers

4903 search results - page 148 / 981
» The Set Covering Machine
Sort
View
CVPR
2010
IEEE
13 years 9 months ago
Modeling pixel means and covariances using factorized third-order boltzmann machines
Learning a generative model of natural images is a useful way of extracting features that capture interesting regularities. Previous work on learning such models has focused on me...
Marc Aurelio Ranzato, Geoffrey E. Hinton
ALGORITHMICA
2006
163views more  ALGORITHMICA 2006»
13 years 9 months ago
Building Large Phylogenetic Trees on Coarse-Grained Parallel Machines
Phylogenetic analysis is an area of computational biology concerned with the reconstruction of evolutionary relationships between organisms, genes, and gene families. Maximum likel...
Thomas M. Keane, Andrew J. Page, Thomas J. Naughto...
JMLR
2010
143views more  JMLR 2010»
13 years 7 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
TSD
2010
Springer
13 years 7 months ago
Using TectoMT as a Preprocessing Tool for Phrase-Based Statistical Machine Translation
Abstract. We present a systematic comparison of preprocessing techniques for two language pairs: English-Czech and English-Hindi. The two target languages, although both belonging ...
Daniel Zeman
ICALP
2007
Springer
14 years 3 months ago
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
Jiong Guo, Rolf Niedermeier