Sciweavers

2570 search results - page 11 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
BMCBI
2010
87views more  BMCBI 2010»
14 years 4 months ago
A fast and robust hepatocyte quantification algorithm including vein processing
Background: Quantification of different types of cells is often needed for analysis of histological images. In our project, we compute the relative number of proliferating hepatoc...
Tetyana Ivanovska, Andrea Schenk, André Hom...
ICIP
2003
IEEE
15 years 11 months ago
Fast Feldkamp algorithm for cone-beam computer tomography
We propose a new fast Feldkamp algorithm for 3-D cone beam tomography with a circular source trajectory. The algorithm is an extension of our recent fast native 2-D fan-beam recon...
Shu Xiao, Yoram Bresler, David C. Munson Jr.
CORR
2006
Springer
114views Education» more  CORR 2006»
14 years 9 months ago
Fast algorithms for computing isogenies between elliptic curves
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an...
Alin Bostan, Bruno Salvy, François Morain, ...
NA
2006
84views more  NA 2006»
14 years 9 months ago
Fast Moreau envelope computation I: numerical algorithms
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
Yves Lucet
SIGPRO
2008
130views more  SIGPRO 2008»
14 years 9 months ago
A fast algorithm for the computation of 2-D forward and inverse MDCT
A fast algorithm for computing the two-dimensional (2-D) forward and inverse modified discrete cosine transform (MDCT and IMDCT) is proposed. The algorithm converts the 2-D MDCT an...
J. S. Wu, Huazhong Shu, Lotfi Senhadji, Limin Luo