Sciweavers

7006 search results - page 143 / 1402
» Approximation Algorithms
Sort
View
121
Voted
WDAG
2004
Springer
130views Algorithms» more  WDAG 2004»
15 years 8 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
JMLR
2006
91views more  JMLR 2006»
15 years 2 months ago
QP Algorithms with Guaranteed Accuracy and Run Time for Support Vector Machines
We describe polynomial
Don R. Hush, Patrick Kelly, Clint Scovel, Ingo Ste...
126
Voted
ECAI
2008
Springer
15 years 4 months ago
An Analysis of Bayesian Network Model-Approximation Techniques
Abstract. Two approaches have been used to perform approximate inference in Bayesian networks for which exact inference is infeasible: employing an approximation algorithm, or appr...
Adamo Santana, Gregory M. Provan
135
Voted
FOCS
2009
IEEE
15 years 9 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov
107
Voted
CORR
2002
Springer
102views Education» more  CORR 2002»
15 years 2 months ago
Tight Approximation Results for General Covering Integer Programs
In this paper we study approximation algorithms for solving a general covering integer program. An
Stavros G. Kolliopoulos, Neal E. Young