Sciweavers

7648 search results - page 421 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
15 years 4 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
ICANN
1997
Springer
15 years 8 months ago
Topology Representing Networks for Intrinsic Dimensionality Estimation
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...
Jörg Bruske, Gerald Sommer
ISBI
2008
IEEE
16 years 5 months ago
An algorithm to map asymmetries of bilateral objects in point clouds
We present a method to automatically quantify the local asymmetries of bilateral structures in point clouds. The method relies on the robust computation of the approximate symmetr...
Benoît Combès, Robin Hennessy, John W...
HPCC
2007
Springer
15 years 11 months ago
Towards a Complexity Model for Design and Analysis of PGAS-Based Algorithms
Many new Partitioned Global Address Space (PGAS) programming languages have recently emerged and are becoming ubiquitously available on nearly all modern parallel architectures. PG...
Mohamed Bakhouya, Jaafar Gaber, Tarek A. El-Ghazaw...
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
15 years 10 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad