Sciweavers

17770 search results - page 265 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
COMPGEOM
2005
ACM
15 years 9 months ago
Multi-pass geometric algorithms
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
Timothy M. Chan, Eric Y. Chen
ESANN
2008
15 years 8 months ago
On related violating pairs for working set selection in SMO algorithms
Sequential Minimal Optimization (SMO) is currently the most popular algorithm to solve large quadratic programs for Support Vector Machine (SVM) training. For many variants of this...
Tobias Glasmachers
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
15 years 8 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
JACM
2000
119views more  JACM 2000»
15 years 7 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
NPL
2002
103views more  NPL 2002»
15 years 6 months ago
Kernel Nearest Neighbor Algorithm
The `kernel approach' has attracted great attention with the development of support vector machine (SVM) and has been studied in a general way. It offers an alternative soluti...
Kai Yu, Liang Ji, Xuegong Zhang