Sciweavers

4039 search results - page 156 / 808
» A Method for Dynamic Clustering of Data
Sort
View
149
Voted
WOMPAT
2001
Springer
15 years 9 months ago
A Study of Implicit Data Distribution Methods for OpenMP Using the SPEC Benchmarks
In contrast to the common belief that OpenMP requires data-parallel extensions to scale well on architectures with non-uniform memory access latency, recent work has shown that it ...
Dimitrios S. Nikolopoulos, Eduard Ayguadé
176
Voted
PODS
1995
ACM
124views Database» more  PODS 1995»
15 years 8 months ago
Window Query-Optimal Clustering of Spatial Objects
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...
Bernd-Uwe Pagel, Hans-Werner Six, Mario Winter
ICDM
2006
IEEE
183views Data Mining» more  ICDM 2006»
15 years 10 months ago
Accelerating Newton Optimization for Log-Linear Models through Feature Redundancy
— Log-linear models are widely used for labeling feature vectors and graphical models, typically to estimate robust conditional distributions in presence of a large number of pot...
Arpit Mathur, Soumen Chakrabarti
NIPS
2004
15 years 6 months ago
Limits of Spectral Clustering
An important aspect of clustering algorithms is whether the partitions constructed on finite samples converge to a useful clustering of the whole data space as the sample size inc...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...
KDD
2009
ACM
161views Data Mining» more  KDD 2009»
15 years 11 months ago
Interactive spatio-temporal cluster analysis of VAST challenge 2008 datasets
We describe a visual analytics method supporting the analysis of two different types of spatio-temporal data, point events and trajectories of moving agents. The method combines c...
Gennady L. Andrienko, Natalia V. Andrienko