Sciweavers

1034 search results - page 157 / 207
» Competitive generalized auctions
Sort
View
AAAI
2006
13 years 10 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
EACL
2006
ACL Anthology
13 years 10 months ago
Automatic Segmentation of Multiparty Dialogue
In this paper, we investigate the problem of automatically predicting segment boundaries in spoken multiparty dialogue. We extend prior work in two ways. We first apply approaches...
Pei-yun Hsueh, Johanna D. Moore, Steve Renals
ECIS
2003
13 years 10 months ago
The value of business intelligence in the context of developing countries
In the corporate context, a combination of constant technological innovation and increasing competitiveness makes the management of information a huge challenge and requires decis...
Maira Petrini, Marlei Pozzebon
NIPS
2004
13 years 10 months ago
The Power of Selective Memory: Self-Bounded Learning of Prediction Suffix Trees
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...
Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer
UAI
2004
13 years 10 months ago
A Hierarchical Graphical Model for Record Linkage
The task of matching co-referent records is known among other names as record linkage. For large record-linkage problems, often there is little or no labeled data available, but u...
Pradeep D. Ravikumar, William W. Cohen