Sciweavers

7536 search results - page 125 / 1508
» Localized Components Analysis
Sort
View
131
Voted
PC
1998
89views Management» more  PC 1998»
15 years 4 months ago
Analysis of Local Enumeration and Storage Schemes in HPF
In this paper, we analyze the efficiency of three local enumeration and three storage compression schemes for cyclic(m) data distributions in High Performance Fortran (HPF). We sh...
Henk J. Sips, Will Denissen, Kees van Reeuwijk
164
Voted
PARA
2004
Springer
15 years 10 months ago
Counting the Number of Connected Components of a Set and Its Application to Robotics
This paper gives a numerical algorithm able to compute the number of path-connected components of a set S defined by nonlinear inequalities. This algorithm uses interval analysis ...
Nicolas Delanoue, Luc Jaulin, Bertrand Cottenceau
CSDA
2008
65views more  CSDA 2008»
15 years 5 months ago
On the number of principal components: A test of dimensionality based on measurements of similarity between matrices
An important problem in principal component analysis (PCA) is the estimation of the correct number of components to retain. PCA is most often used to reduce a set of observed vari...
Stéphane Dray
118
Voted
ENTCS
2006
127views more  ENTCS 2006»
15 years 5 months ago
Component Identification Through Program Slicing
This paper reports on the development of specific slicing techniques for functional programs and their use for the identification of possible coherent components from monolithic c...
Nuno F. Rodrigues, Luís Soares Barbosa
CORR
2006
Springer
125views Education» more  CORR 2006»
15 years 5 months ago
Barriers and local minima in energy landscapes of stochastic local search
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
Petteri Kaski