Sciweavers

494 search results - page 86 / 99
» Probabilistic Programming in Anglican
Sort
View
IJCAI
2007
14 years 11 months ago
All Common Subsequences
Time series data abounds in real world problems. Measuring the similarity of time series is a key to solving these problems. One state of the art measure is the longest common sub...
Hui Wang
UAI
2008
14 years 11 months ago
Church: a language for generative models
Formal languages for probabilistic modeling enable re-use, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal langu...
Noah Goodman, Vikash K. Mansinghka, Daniel M. Roy,...
AAAI
2006
14 years 11 months ago
Functional Value Iteration for Decision-Theoretic Planning with General Utility Functions
We study how to find plans that maximize the expected total utility for a given MDP, a planning objective that is important for decision making in high-stakes domains. The optimal...
Yaxin Liu, Sven Koenig
ACL
1996
14 years 11 months ago
Minimizing Manual Annotation Cost in Supervised Training from Corpora
Corpus-based methods for natural language processing often use supervised training, requiring expensive manual annotation of training corpora. This paper investigates methods for ...
Sean P. Engelson, Ido Dagan
JACM
2006
98views more  JACM 2006»
14 years 10 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson