17760 search results - page 230 / 3552 » A Generalization of the Massey-Ding Algorithm |
134
click to vote
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
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...
135
click to vote
ESANN
2008
15 years 6 months ago
2008
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...
138
click to vote
SODA
2001
ACM
15 years 6 months ago
2001
ACM
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...
165
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
In this paper, we propose a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). Previous information-theoretic model selection cri...
162
Voted
DAC
2006
ACM
16 years 5 months ago
2006
ACM
Scheduling plays a central role in the behavioral synthesis process, which automatically compiles high-level specifications into optimized hardware implementations. However, most ...