Sciweavers

694 search results - page 22 / 139
» On the Dimensions of Data Complexity through Synthetic Data ...
Sort
View
PAKDD
2005
ACM
142views Data Mining» more  PAKDD 2005»
14 years 2 months ago
Dynamic Cluster Formation Using Level Set Methods
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...
Andy M. Yip, Chris H. Q. Ding, Tony F. Chan
ADC
2003
Springer
123views Database» more  ADC 2003»
14 years 2 months ago
A Distance-Based Packing Method for High Dimensional Data
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
Tae-wan Kim, Ki-Joune Li
ECCV
2002
Springer
14 years 10 months ago
Multimodal Data Representations with Parameterized Local Structures
Abstract. In many vision problems, the observed data lies in a nonlinear manifold in a high-dimensional space. This paper presents a generic modelling scheme to characterize the no...
Ying Zhu, Dorin Comaniciu, Stuart C. Schwartz, Vis...
EUROPAR
2003
Springer
14 years 2 months ago
KOJAK - A Tool Set for Automatic Performance Analysis of Parallel Programs
Abstract. Today’s parallel computers with SMP nodes provide both multithreading and message passing as their modes of parallel execution. As a consequence, performance analysis a...
Bernd Mohr, Felix Wolf
PSD
2004
Springer
132views Database» more  PSD 2004»
14 years 2 months ago
Computational Experiments with Minimum-Distance Controlled Perturbation Methods
Minimum-distance controlled perturbation is a recent family of methods for the protection of statistical tabular data. These methods are both efficient and versatile, since can dea...
Jordi Castro