1301 search results - page 40 / 261 » Bounded Version Vectors |
135
Voted
AICCSA
2001
IEEE
15 years 7 months ago
2001
IEEE
In this paper, we propose a new version of the topological maps algorithm, which has been used to cluster web site visitors. These are characterized by partially redundant variabl...
162
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
The Compressive Sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse s...
118
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
134
click to vote
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
160
Voted
NIPS
2004
2004
Class-size Independent Generalization Analsysis of Some Discriminative Multi-Category Classification
15 years 5 months ago
We consider the problem of deriving class-size independent generalization bounds for some regularized discriminative multi-category classification methods. In particular, we obtai...