Sciweavers

2370 search results - page 116 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
NIPS
2007
14 years 11 months ago
Estimating divergence functionals and the likelihood ratio by penalized convex risk minimization
We develop and analyze an algorithm for nonparametric estimation of divergence functionals and the density ratio of two probability distributions. Our method is based on a variati...
XuanLong Nguyen, Martin J. Wainwright, Michael I. ...
AAAI
2006
14 years 11 months ago
When Is Constrained Clustering Beneficial, and Why?
Several researchers have illustrated that constraints can improve the results of a variety of clustering algorithms. However, there can be a large variation in this improvement, e...
Kiri Wagstaff, Sugato Basu, Ian Davidson
NIPS
2001
14 years 11 months ago
Thin Junction Trees
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
Francis R. Bach, Michael I. Jordan
NAACL
2003
14 years 11 months ago
Simpler and More General Minimization for Weighted Finite-State Automata
Previous work on minimizing weighted finite-state automata (including transducers) is limited to particular types of weights. We present efficient new minimization algorithms th...
Jason Eisner
ICGA
1993
75views Optimization» more  ICGA 1993»
14 years 11 months ago
Structure and Performance of Fine-Grain Parallelism in Genetic Search
Within the parallel genetic algorithm framework, there currently exists a growing dichotomy between coarse-pain and fine-grain parallel architectures. This paper attempts to chara...
Shumeet Baluja