3367 search results - page 356 / 674 » Incremental assignment problem |
124
click to vote
EMNLP
2008
15 years 6 months ago
2008
This paper presents two approaches to ranking reader emotions of documents. Past studies assign a document to a single emotion category, so their methods cannot be applied directl...
122
Voted
NIPS
2007
15 years 6 months ago
2007
We investigate a new, convex relaxation of an expectation-maximization (EM) variant that approximates a standard objective while eliminating local minima. First, a cautionary resu...
128
click to vote
ACL
2004
15 years 6 months ago
2004
This paper describes an algorithm for detecting empty nodes in the Penn Treebank (Marcus et al., 1993), finding their antecedents, and assigning them function tags, without access...
189
click to vote
ICMLA
2004
15 years 6 months ago
2004
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
147
click to vote
UAI
2003
15 years 6 months ago
2003
We consider the problem of learning a Riemannian metric associated with a given differentiable manifold and a set of points. Our approach to the problem involves choosing a metric...