Sciweavers

5109 search results - page 718 / 1022
» On Learning Limiting Programs
Sort
View
ICML
2008
IEEE
16 years 5 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
157
Voted
ICML
2006
IEEE
16 years 5 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
ICML
2003
IEEE
16 years 5 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
SIGCSE
2009
ACM
119views Education» more  SIGCSE 2009»
16 years 5 months ago
The summer academy for advancing deaf and hard of hearing in computing
Deaf and hard of hearing students are an underrepresented group in computing and face extra challenges in university-level computing courses. This paper describes a 9-week Summer ...
Anna Cavender, Richard E. Ladner, Robert I. Roth
KDD
2002
ACM
184views Data Mining» more  KDD 2002»
16 years 5 months ago
The Community of Multimedia Agents
Multimedia data mining requires the ability to automatically analyze and understand the content. The Community of Multimedia Agents project is devoted to creating a community of re...
Gang Wei, Valery A. Petrushin, Anatole Gershman