Sciweavers

7150 search results - page 185 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
WDAG
2004
Springer
130views Algorithms» more  WDAG 2004»
15 years 11 months ago
Distributed Weighted Matching
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
Mirjam Wattenhofer, Roger Wattenhofer
JAT
2007
84views more  JAT 2007»
15 years 6 months ago
On Lebesgue-type inequalities for greedy approximation
We study the efficiency of greedy algorithms with regard to redundant dictionaries in Hilbert spaces. We obtain upper estimates for the errors of the Pure Greedy Algorithm and th...
David L. Donoho, Michael Elad, Vladimir N. Temlyak...
NIPS
2003
15 years 7 months ago
AUC Optimization vs. Error Rate Minimization
The area under an ROC curve (AUC) is a criterion used in many applications to measure the quality of a classification algorithm. However, the objective function optimized in most...
Corinna Cortes, Mehryar Mohri
SARA
2007
Springer
16 years 17 days ago
Approximate Model-Based Diagnosis Using Greedy Stochastic Search
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
16 years 1 months ago
Every Permutation CSP of arity 3 is Approximation Resistant
Moses Charikar, Venkatesan Guruswami, Rajsekar Man...