874 search results - page 99 / 175 » Faster Algorithms for Semi-Matching Problems |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
100
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We consider the problem of fitting a discrete curve to time-labeled data points on the set Pn of all n-by-n symmetric positive-definite matrices. The quality of a curve is measu...
104
click to vote
ICCV
2011
IEEE
13 years 10 months ago
2011
IEEE
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...
ACL
2012
13 years 11 days 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...
ACL
2012
13 years 11 days ago
2012
We address the problem of learning the mapping between words and their possible pronunciations in terms of sub-word units. Most previous approaches have involved generative modeli...