Sciweavers

431 search results - page 1 / 87
» Implementing the maximum of monotone algorithms
Sort
View
ATAL
2007
Springer
13 years 11 months ago
Implementing the maximum of monotone algorithms
Running several sub-optimal algorithms and choosing the optimal one is a common procedure in computer science, most notably in the design of approximation algorithms. This paper d...
Liad Blumrosen
MP
2008
129views more  MP 2008»
13 years 5 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
APPROX
2007
Springer
67views Algorithms» more  APPROX 2007»
13 years 11 months ago
Maximum Gradient Embeddings and Monotone Clustering
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
Manor Mendel, Assaf Naor
ORL
2000
77views more  ORL 2000»
13 years 5 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
JMLR
2011
148views more  JMLR 2011»
13 years 12 days ago
Multitask Sparsity via Maximum Entropy Discrimination
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...
Tony Jebara