Sciweavers

7129 search results - page 215 / 1426
» Approximation Algorithms for Treewidth
Sort
View
SDM
2007
SIAM
81views Data Mining» more  SDM 2007»
15 years 5 months ago
A PAC Bound for Approximate Support Vector Machines
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
Dongwei Cao, Daniel Boley
JSC
2008
162views more  JSC 2008»
15 years 3 months ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...
EWC
2007
93views more  EWC 2007»
15 years 3 months ago
Approximation of involute curves for CAD-system processing
In numerous instances, accurate algorithms for approximating the original geometry is required. One typical example is a circle involute curve which represents the underlying geom...
Fumitaka Higuchi, Shuichi Gofuku, Takashi Maekawa,...
WAE
2000
103views Algorithms» more  WAE 2000»
15 years 5 months ago
Lattice Basis Reduction with Dynamic Approximation
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
Werner Backes, Susanne Wetzel
125
Voted
JCT
2006
100views more  JCT 2006»
15 years 3 months ago
Approximating clique-width and branch-width
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph "clique-wi...
Sang-il Oum, Paul D. Seymour