Sciweavers

6365 search results - page 94 / 1273
» Fast Local Computation Algorithms
Sort
View
128
Voted
CVPR
2004
IEEE
16 years 4 months ago
A Fast Multigrid Implicit Algorithm for the Evolution of Geodesic Active Contours
Active contour models are among the most popular PDE-based tools in computer vision. In this paper we present a new algorithm for the fast evolution of geodesic active contours an...
George Papandreou, Petros Maragos
112
Voted
ISCAS
2007
IEEE
95views Hardware» more  ISCAS 2007»
15 years 8 months ago
A Universal Approach to Developing Fast Algorithm for Simplified Order-16 ICT
—Simplified order-16 Integer Cosine Transform (ICT) has been proved to be an efficient coding tool especially for High-Definition (HD) video coding and is much simpler than ICT a...
Jie Dong, King Ngi Ngan, Chi-Keung Fong, Wai-kuen ...
ICPR
2008
IEEE
16 years 3 months ago
3D rotation invariant local binary patterns
We present a novel method for the fast computation of rotation invariant "local binary patterns" (LBP) on 3D volume data. Unlike a previous publication on 3D LBP, this n...
Hans Burkhardt, Janis Fehr
IPPS
2003
IEEE
15 years 7 months ago
A Fast Algorithm for the Exhaustive Analysis of 12-Nucleotide-Long DNA Sequences. Applications to Human Genomics
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...
Vicente Arnau, Ignacio Marín
130
Voted
DAC
1996
ACM
15 years 6 months ago
Computing Parametric Yield Adaptively Using Local Linear Models
Abstract A divide-and-conquer algorithm for computing the parametric yield of large analog circuits is presented. The algorithm targets applications whose performance spreads could...
Mien Li, Linda S. Milor