Sciweavers

10146 search results - page 85 / 2030
» Fast FAST
Sort
View

Publication
241views
15 years 4 months ago
Fast compositing for cluster-parallel rendering
The image compositing stages in cluster-parallel rendering for gathering and combining partial rendering results into a final display frame are fundamentally limited by node-to-nod...
Maxim Makhinya, Stefan Eilemann, Renato Pajarola
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 2 months ago
Fast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
Ryan J. Tibshirani
IAJIT
2006
145views more  IAJIT 2006»
15 years 2 months ago
Fast 160-Bits GF (P) Elliptic Curve Crypto Hardware of High-Radix Scalable Multipliers
In this paper, a fast hardware architecture for elliptic curve cryptography computation in Galois Field GF(p) is proposed. The architecture is implemented for 160-bits, as its dat...
Adnan Abdul-Aziz Gutub
123
Voted
MVA
2008
130views Computer Vision» more  MVA 2008»
15 years 2 months ago
Fast pattern recognition using normalized grey-scale correlation in a pyramid image representation
The ability to quickly locate one or more instances of a model in a grey scale image is of importance to industry. The recognition/localization must be fast and accurate. In this p...
W. James MacLean, John K. Tsotsos
NA
2006
84views more  NA 2006»
15 years 2 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