Sciweavers

4212 search results - page 138 / 843
» On Compressible Pairings and Their Computation
Sort
View
SAC
2009
ACM
16 years 1 months ago
An enhanced multi-view video compression using the constrained inter-view prediction
We propose a method that uses the restricted inter-view prediction for multi-view video coding. In the multi-view video, there exists occluded area because of the locations and an...
Sunghwan Chun, Seoyoung Lee, Kwangmu Shin, Kidong ...
COMBINATORICS
1999
61views more  COMBINATORICS 1999»
15 years 6 months ago
A Fibonacci-like Sequence of Composite Numbers
In 1964, Ronald Graham proved that there exist relatively prime natural numbers a and b such that the sequence {An} defined by An = An-1 + An-2 (n 2; A0 = a, A1 = b) contains no ...
John W. Nicol
WEA
2010
Springer
476views Algorithms» more  WEA 2010»
16 years 1 months ago
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
Chris Whidden, Robert G. Beiko, Norbert Zeh
CHI
2006
ACM
16 years 6 months ago
Time is of the essence: an evaluation of temporal compression algorithms
Although speech is a potentially rich information source, a major barrier to exploiting speech archives is the lack of useful tools for efficiently accessing lengthy speech record...
Simon Tucker, Steve Whittaker
DCC
2002
IEEE
16 years 6 months ago
PPMexe: PPM for Compressing Software
With the emergence of software delivery platforms such as Microsoft's .NET, code compression has become one of the core enabling technologies strongly affecting system perfor...
Milenko Drinic, Darko Kirovski