Sciweavers

4255 search results - page 602 / 851
» On Learning Boolean Functions
Sort
View
JFP
2002
96views more  JFP 2002»
13 years 8 months ago
Secrets of the Glasgow Haskell Compiler inliner
Higher-order languages, such as Haskell, encourage the proto build abstractions by composing functions. A good compiler must inline many of these calls to recover an e ciently exe...
Simon L. Peyton Jones, Simon Marlow
IEICET
2010
132views more  IEICET 2010»
13 years 6 months ago
Direct Importance Estimation with a Mixture of Probabilistic Principal Component Analyzers
Estimating the ratio of two probability density functions (a.k.a. the importance) has recently gathered a great deal of attention since importance estimators can be used for solvi...
Makoto Yamada, Masashi Sugiyama, Gordon Wichern, J...
TAL
2010
Springer
13 years 6 months ago
Passage Retrieval in Log Files: An Approach Based on Query Enrichment
Abstract. The question answering systems are considered the next generation of search engines. This paper focuses on the first step of this process, which is to search for relevant...
Hassan Saneifar, Stéphane Bonniol, Anne Lau...
COLING
2010
13 years 3 months ago
Controlling Listening-oriented Dialogue using Partially Observable Markov Decision Processes
This paper investigates how to automatically create a dialogue control component of a listening agent to reduce the current high cost of manually creating such components. We coll...
Toyomi Meguro, Ryuichiro Higashinaka, Yasuhiro Min...
JMLR
2011
167views more  JMLR 2011»
13 years 3 months ago
Logistic Stick-Breaking Process
A logistic stick-breaking process (LSBP) is proposed for non-parametric clustering of general spatially- or temporally-dependent data, imposing the belief that proximate data are ...
Lu Ren, Lan Du, Lawrence Carin, David B. Dunson