1161 search results - page 32 / 233 » Approximation schemes for clustering problems |
ICCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...
MOC
2002
14 years 9 months ago
2002
We consider a family of tensor product finite element methods for hyperbolic equations in RN , N 2, which are explicit and generate a continuous approximate solution. The base cas...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
PODS
2008
ACM
15 years 9 months ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
157
click to vote
SDM
2012
SIAM
13 years 1 days ago
2012
SIAM
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...