Sciweavers

540 search results - page 73 / 108
» The Sinkhorn-Knopp Algorithm: Convergence and Applications
Sort
View
JAIR
2007
112views more  JAIR 2007»
13 years 7 months ago
Cutset Sampling for Bayesian Networks
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network s...
Bozhena Bidyuk, Rina Dechter
JMLR
2002
138views more  JMLR 2002»
13 years 7 months ago
Text Chunking based on a Generalization of Winnow
This paper describes a text chunking system based on a generalization of the Winnow algorithm. We propose a general statistical model for text chunking which we then convert into ...
Tong Zhang, Fred Damerau, David Johnson
RC
2007
83views more  RC 2007»
13 years 7 months ago
Computing the Pessimism of Inclusion Functions
Abstract. “Computing the pessimism” means bounding the overestimation produced by an inclusion function. There are two important distinctions with classical error analysis. Fir...
Gilles Chabert, Luc Jaulin
ECML
2006
Springer
13 years 11 months ago
Prioritizing Point-Based POMDP Solvers
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods such as PBVI, Perseus, and HSVI, which quickly converge to an approximate so...
Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony
HEURISTICS
2008
120views more  HEURISTICS 2008»
13 years 8 months ago
A local linear embedding module for evolutionary computation optimization
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Fabio Boschetti