Sciweavers

253 search results - page 39 / 51
» Data structures in Java for matrix computations
Sort
View
97
Voted
PVM
2004
Springer
15 years 7 months ago
A Refinement Strategy for a User-Oriented Performance Analysis
We introduce a refinement strategy to bring the parallel performance analysis closer to the user. The analysis starts with a simple high-level performance model. It is based on fir...
Jan Lemeire, Andy Crijns, John Crijns, Erik F. Dir...
IMAMS
2003
212views Mathematics» more  IMAMS 2003»
15 years 3 months ago
Watermarking 3D Polygonal Meshes Using the Singular Spectrum Analysis
Watermarking is to embed a structure called a watermark into the target data such as images. The watermark can be used, for example, in order to secure the copyright and detect tam...
Kohei Muratani, Kokichi Sugihara
104
Voted
CSDA
2010
157views more  CSDA 2010»
15 years 2 months ago
Robust estimation of constrained covariance matrices for confirmatory factor analysis
Confirmatory factor analysis (CFA) is a data anylsis procedure that is widely used in social and behavioral sciences in general and other applied sciences that deal with large qua...
E. Dupuis Lozeron, M. P. Victoria-Feser
153
Voted
ICCV
2011
IEEE
14 years 2 months ago
Latent Low-Rank Representation for Subspace Segmentation and Feature Extraction
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
Guangcan Liu, Shuicheng Yan
WMPI
2004
ACM
15 years 7 months ago
The Opie compiler from row-major source to Morton-ordered matrices
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
Steven T. Gabriel, David S. Wise