93 search results - page 13 / 19 » Fast Monte-Carlo Algorithms for Finding Low-Rank Approximati... |
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
Abstract. The retrieval of objects from a multimedia database employs a measure which defines a similarity score for every pair of objects. The measure should effectively follow th...
TIP
2008
13 years 7 months ago
2008
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
KDD
2003
ACM
14 years 7 months ago
2003
ACM
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...