Sciweavers

1285 search results - page 223 / 257
» On the Complexity of Ordinal Clustering
Sort
View
DPD
2002
125views more  DPD 2002»
13 years 7 months ago
Parallel Mining of Outliers in Large Database
Data mining is a new, important and fast growing database application. Outlier (exception) detection is one kind of data mining, which can be applied in a variety of areas like mon...
Edward Hung, David Wai-Lok Cheung
FGCS
2002
153views more  FGCS 2002»
13 years 7 months ago
HARNESS fault tolerant MPI design, usage and performance issues
Initial versions of MPI were designed to work efficiently on multi-processors which had very little job control and thus static process models. Subsequently forcing them to suppor...
Graham E. Fagg, Jack Dongarra
CGF
1998
127views more  CGF 1998»
13 years 7 months ago
Getting Rid of Links in Hierarchical Radiosity
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...
Marc Stamminger, Hartmut Schirmacher, Philipp Slus...
PAMI
1998
128views more  PAMI 1998»
13 years 7 months ago
A Hierarchical Latent Variable Model for Data Visualization
—Visualization has proven to be a powerful and widely-applicable tool for the analysis and interpretation of multivariate data. Most visualization algorithms aim to find a projec...
Christopher M. Bishop, Michael E. Tipping
CORR
2010
Springer
63views Education» more  CORR 2010»
13 years 7 months ago
Simplified Distributed Programming with Micro Objects
Developing large-scale distributed applications can be a daunting task. One of the problems that application developers are confronted with is the distribution of data, processes, ...
Jan-Mark S. Wams, Maarten van Steen