Sciweavers

2750 search results - page 407 / 550
» Learning Efficient Parsing
Sort
View
82
Voted
ICML
2003
IEEE
15 years 11 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
2007
ACM
15 years 11 months ago
Generative models for name disambiguation
Name ambiguity is a special case of identity uncertainty where one person can be referenced by multiple name variations in different situations or even share the same name with ot...
Yang Song, Jian Huang 0002, Isaac G. Councill, Jia...
WWW
2004
ACM
15 years 11 months ago
Post-processing inkml for random-access navigation of voluminous handwritten ink documents
The goal of this research is the improvement of browsing voluminous InkML data in two areas: ease of rendering continuous inkflow for replay-browsing, and ease of random access na...
Khaireel A. Mohamed, Lioudmila Belenkaia, Thomas O...
KDD
2008
ACM
132views Data Mining» more  KDD 2008»
15 years 10 months ago
Partitioned logistic regression for spam filtering
Naive Bayes and logistic regression perform well in different regimes. While the former is a very simple generative model which is efficient to train and performs well empirically...
Ming-wei Chang, Wen-tau Yih, Christopher Meek
KDD
2005
ACM
109views Data Mining» more  KDD 2005»
15 years 10 months ago
Formulating distance functions via the kernel trick
Tasks of data mining and information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be for...
Gang Wu, Edward Y. Chang, Navneet Panda