54 search results - page 4 / 11 » Sublinear-Time Approximation for Clustering Via Random Sampl... |
JISE
2010
13 years 2 months ago
2010
In dealing with large datasets the reduced support vector machine (RSVM) was proposed for the practical objective to overcome the computational difficulties as well as to reduce t...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
This paper proposes Twin Vector Machine (TVM), a constant space and sublinear time Support Vector Machine (SVM) algorithm for online learning. TVM achieves its favorable scaling b...
SADM
2010
13 years 6 months ago
2010
: This paper proposes twin prototype support vector machine (TVM), a constant space and sublinear time support vector machine (SVM) algorithm for online learning. TVM achieves its ...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper we consider the problem of sampling far below the Nyquist rate signals that are sparse linear superpositions of shifts of a known, potentially wide-band, pulse. This...
ICALP
2010
Springer
14 years 15 days ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...