227 search results - page 39 / 46 » A splitting method for stochastic programs |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
JMLR
2012
11 years 10 months ago
2012
In recent years there has been a lot of interest in designing principled classification algorithms over multiple cues, based on the intuitive notion that using more features shou...
ACL
1996
13 years 8 months ago
1996
Corpus-based methods for natural language processing often use supervised training, requiring expensive manual annotation of training corpora. This paper investigates methods for ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
MICRO
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Parallel programming is hard, because it is impractical to test all possible thread interleavings. One promising approach to improve a multi-threaded program's relia...