Sciweavers

2570 search results - page 72 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
SADM
2008
178views more  SADM 2008»
14 years 9 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
ICIP
2007
IEEE
15 years 11 months ago
Dart: A Fast Heuristic Algebraic Reconstruction Algorithm for Discrete Tomography
Discrete tomography (DT) is concerned with the tomographic reconstruction of images that consist of only a small number of gray levels. DT reconstruction problems are usually unde...
Kees Joost Batenburg, Jan Sijbers
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
15 years 10 months ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...
ISBI
2004
IEEE
15 years 10 months ago
A Fast Fully 4D Incremental Gradient Reconstruction Algorithm for List Mode PET Data
We present a fully four-dimensional, globally convergent, incremental gradient algorithm to estimate the continuous-time tracer density from list mode positron emission tomography...
Quanzheng Li, Evren Asma, Richard M. Leahy
ASIACRYPT
1999
Springer
15 years 2 months ago
Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
Yongfei Han, Peng-Chor Leong, Peng-Chong Tan, Jian...