Sciweavers

3145 search results - page 506 / 629
» Algebraic Linear Orderings
Sort
View
ICML
2008
IEEE
16 years 6 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
ICML
2003
IEEE
16 years 6 months ago
Planning in the Presence of Cost Functions Controlled by an Adversary
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum
WWW
2008
ACM
16 years 6 months ago
Keyword extraction for contextual advertisement
As the largest online marketplace, eBay strives to promote its inventory throughout the Web via different types of online advertisement. Contextually relevant links to eBay assets...
Xiaoyuan Wu, Alvaro Bolivar
KDD
2008
ACM
135views Data Mining» more  KDD 2008»
16 years 6 months ago
Effective and efficient itemset pattern summarization: regression-based approaches
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
Ruoming Jin, Muad Abu-Ata, Yang Xiang, Ning Ruan
KDD
2003
ACM
192views Data Mining» more  KDD 2003»
16 years 6 months ago
Efficient elastic burst detection in data streams
Burst detection is the activity of finding abnormal aggregates in data streams. Such aggregates are based on sliding windows over data streams. In some applications, we want to mo...
Yunyue Zhu, Dennis Shasha