Sciweavers

561 search results - page 82 / 113
» Algorithms and applications for approximate nonnegative matr...
Sort
View
PPOPP
1991
ACM
13 years 11 months ago
Coarse-Grain Parallel Programming in Jade
This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those ...
Monica S. Lam, Martin C. Rinard
POPL
2007
ACM
14 years 8 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
CSDA
2006
71views more  CSDA 2006»
13 years 7 months ago
Computation of Huber's M-estimates for a block-angular regression problem
Huber's M-estimation technique is applied to a block-angular regression problem, which may arise from some applications. A recursive, modified Newton approach to computing th...
Xiao-Wen Chang
IPPS
2006
IEEE
14 years 1 months ago
On the performance of parallel normalized explicit preconditioned conjugate gradient type methods
A new class of parallel normalized preconditioned conjugate gradient type methods in conjunction with normalized approximate inverses algorithms, based on normalized approximate f...
George A. Gravvanis, Konstantinos M. Giannoutakis
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 7 months ago
Fast Algorithm and Implementation of Dissimilarity Self-Organizing Maps
In many real-world applications, data cannot be accurately represented by vectors. In those situations, one possible solution is to rely on dissimilarity measures that enable a se...
Brieuc Conan-Guez, Fabrice Rossi, Aïcha El Go...