Sciweavers

2745 search results - page 139 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
JVCIR
2006
126views more  JVCIR 2006»
15 years 3 months ago
Efficient intra- and inter-mode selection algorithms for H.264/ AVC
Intra-frame mode selection and inter-frame mode selection are new features introduced in the H.264 standard. Intra-frame mode selection dramatically reduces spatial redundancy in ...
Andy C. Yu, King Ngi Ngan, Graham R. Martin
VLDB
2001
ACM
139views Database» more  VLDB 2001»
15 years 8 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...
BMCBI
2006
143views more  BMCBI 2006»
15 years 3 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...
CGF
2005
95views more  CGF 2005»
15 years 3 months ago
Fast Summed-Area Table Generation and its Applications
We introduce a technique to rapidly generate summed-area tables using graphics hardware. Summed area tables, originally introduced by Crow, provide a way to filter arbitrarily lar...
Justin Hensley, Thorsten Scheuermann, Greg Coombe,...
DAPSYS
2004
Springer
15 years 9 months ago
Analysis of the Multi-Phase Copying Garbage Collection Algorithm
The multi-phase copying garbage collection was designed to avoid the need for large amount of reserved memory usually required for the copying types of garbage collection algorithm...
Norbert Podhorszki