Sciweavers

2930 search results - page 328 / 586
» The optimal sequence compression
Sort
View
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
16 years 2 hour ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
ACNS
2010
Springer
154views Cryptology» more  ACNS 2010»
15 years 11 months ago
Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions
To this day, realizations in the standard-model of (lossy) trapdoor functions from discrete-log-type assumptions require large public key sizes, e.g., about Θ(λ2 ) group elements...
Xavier Boyen, Brent Waters
HPCC
2007
Springer
15 years 10 months ago
A Highly Efficient Parallel Algorithm for H.264 Encoder Based on Macro-Block Region Partition
This paper proposes a highly efficient MBRP parallel algorithm for H.264 encoder, which is based on the analysis of data dependencies in H.264 encoder. In the algorithm, the video ...
Shuwei Sun, Dong Wang, Shuming Chen
HPDC
2000
IEEE
15 years 10 months ago
Automatic Configuration and Run-time Adaptation of Distributed Applications
Increased platform heterogeneity and varying resource availability in distributed systems motivates the design of resource-aware applications, which ensure a desired performance l...
Fangzhe Chang, Vijay Karamcheti
CIE
2008
Springer
15 years 8 months ago
Effective Dimensions and Relative Frequencies
Consider the problem of calculating the fractal dimension of a set X consisting of all infinite sequences S over a finite alphabet that satisfy some given condition P on the asympt...
Xiaoyang Gu, Jack H. Lutz