Sciweavers

2600 search results - page 163 / 520
» Clustering with or without the Approximation
Sort
View
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
16 years 7 months ago
Detecting time series motifs under uniform scaling
Time series motifs are approximately repeated patterns found within the data. Such motifs have utility for many data mining algorithms, including rule-discovery, novelty-detection...
Dragomir Yankov, Eamonn J. Keogh, Jose Medina, Bil...
JMLR
2010
198views more  JMLR 2010»
15 years 5 months ago
On Learning with Integral Operators
A large number of learning algorithms, for example, spectral clustering, kernel Principal Components Analysis and many manifold methods are based on estimating eigenvalues and eig...
Lorenzo Rosasco, Mikhail Belkin, Ernesto De Vito
ICPR
2008
IEEE
16 years 28 days ago
Evaluation of clustering methods for finding dominant optical flow fields in crowded scenes
Video footage of real crowded scenes still poses severe challenges for automated surveillance. This paper evaluates clustering methods for finding independent dominant motion fi...
Günther Eibl, Norbert Brändle
CLUSTER
2007
IEEE
16 years 25 days ago
The design of MPI based distributed shared memory systems to support OpenMP on clusters
— OpenMP can be supported in cluster environments by using distributed shared memory (DSM) systems. A portable approach for building DSM systems is to layer it on MPI. With these...
H'sien J. Wong, Alistair P. Rendell
NPC
2007
Springer
16 years 19 days ago
Performance Prediction for Mappings of Distributed Applications on PC Clusters
Abstract. Distributed applications running on clusters may be composed of several components with very different performance requirements. The FlowVR middleware allows the develop...
Sylvain Jubertie, Emmanuel Melin