Sciweavers

761 search results - page 84 / 153
» Efficient Approximation Algorithms for the Subset-Sums Equal...
Sort
View
EACL
2009
ACL Anthology
14 years 8 months ago
Translation as Weighted Deduction
We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise...
Adam Lopez
VLDB
2006
ACM
162views Database» more  VLDB 2006»
14 years 8 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
GECCO
2006
Springer
173views Optimization» more  GECCO 2006»
13 years 11 months ago
Pareto-coevolutionary genetic programming classifier
The conversion and extension of the Incremental ParetoCoevolution Archive algorithm (IPCA) into the domain of Genetic Programming classifier evolution is presented. In order to ac...
Michal Lemczyk, Malcolm I. Heywood
NN
2000
Springer
192views Neural Networks» more  NN 2000»
13 years 7 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
UAI
2004
13 years 9 months ago
PAC-learning Bounded Tree-width Graphical Models
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
Mukund Narasimhan, Jeff A. Bilmes