Sciweavers

583 search results - page 28 / 117
» On small blocking sets and their linearity
Sort
View
CLUSTER
2011
IEEE
13 years 11 months ago
Achieving Scalable Parallelization for the Hessenberg Factorization
—Much of dense linear algebra has been successfully blocked to concentrate the majority of its time in the Level 3 BLAS, which are not only efficient for serial computation, but...
Anthony M. Castaldo, R. Clint Whaley
IVC
2007
184views more  IVC 2007»
14 years 11 months ago
Image distance functions for manifold learning
Many natural image sets are samples of a low-dimensional manifold in the space of all possible images. When the image data set is not a linear combination of a small number of bas...
Richard Souvenir, Robert Pless
DCC
2005
IEEE
15 years 11 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
ICMCS
2005
IEEE
81views Multimedia» more  ICMCS 2005»
15 years 4 months ago
Multiple Objective Frame Rate Up Conversion
In this paper, we propose a multiple objective frame rate up conversion algorithm (MOFRUC), which utilizes two different models. The first model is a constant velocity model that ...
Tak-Song Chong, Oscar C. Au, Wing-San Chau, Tai-Wa...
ASPLOS
1992
ACM
15 years 3 months ago
Access Normalization: Loop Restructuring for NUMA Compilers
: In scalable parallel machines, processors can make local memory accesses much faster than they can make remote memory accesses. In addition, when a number of remote accesses must...
Wei Li, Keshav Pingali