2040 search results - page 287 / 408 » Approximate Expectation Maximization |
166
Voted
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
We propose a method of clustering images that combines algorithmic and human input. An algorithm provides us with pairwise image similarities. We then actively obtain selected, mo...
169
Voted
ACL
2012
13 years 5 months ago
2012
The named entity disambiguation task is to resolve the many-to-many correspondence between ambiguous names and the unique realworld entity. This task can be modeled as a classifi...
154
Voted
AAAI
2012
13 years 5 months ago
2012
Probabilistic relational PCA (PRPCA) can learn a projection matrix to perform dimensionality reduction for relational data. However, the results learned by PRPCA lack interpretabi...
219
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
126
click to vote
FCT
2005
Springer
15 years 9 months ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...