9787 search results - page 574 / 1958 » A Utile Function Optimizer |
207
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
230
click to vote
ICPP
1991
IEEE
15 years 10 months ago
1991
IEEE
Data decomposition is probably the most successful method for generating parallel programs. In this paper a general framework is described for the automatic generation of parallel...
193
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
This paper addresses the problem of jointly clustering two segmentations of closely correlated images. We focus in particular on the application of reconstructing neuronal structu...
195
click to vote
NIPS
2008
15 years 8 months ago
2008
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...
190
click to vote
DMIN
2006
15 years 8 months ago
2006
An approach to build a multi-class classifier is proposed in this paper. This approach consists of a derivation to show under which loss function an optimal classifier can be obtai...