1301 search results - page 98 / 261 » Bounded Version Vectors |
147
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
It is common in classification methods to first place data in a vector space and then learn decision boundaries. We propose reversing that process: for fixed decision boundaries, ...
140
Voted
ALT
2004
Springer
16 years 16 days ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
123
click to vote
GBRPR
2009
Springer
15 years 10 months ago
2009
Springer
A universal data model, named DG, is introduced to handle vectorized data uniformly during the whole recognition process. The model supports low level graph algorithms as well as h...
120
click to vote
ICA
2007
Springer
15 years 9 months ago
2007
Springer
We have derived a new algorithm for dictionary learning for sparse coding in the ℓ1 exact sparse framework. The algorithm does not rely on an approximation residual to operate, b...
211
Voted
LITP
1990
15 years 7 months ago
1990
In this paper we provide several new results concerning word and matrix semigroup problems using counter automaton models. As a main result, we prove a new version of Post's c...