Sciweavers

2621 search results - page 57 / 525
» Near orders and codes
Sort
View
DBPL
1995
Springer
124views Database» more  DBPL 1995»
15 years 7 months ago
Scaling Database Languages to Higher-Order Distributed Programming
We describe the Tycoon   approach to scale the successful notion of a uniform, type-safe persistent object store to communication-intensive applications and applications where lo...
Bernd Mathiske, Florian Matthes, Joachim W. Schmid...
CL
2002
Springer
15 years 4 months ago
Orderly communication in the Ambient Calculus
The Ambient Calculus (henceforth, AC) was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code [9]. We present a type system for AC ...
Torben Amtoft, A. J. Kfoury, Santiago M. Peric&aac...
TIP
2010
129views more  TIP 2010»
15 years 2 months ago
Selective Data Pruning-Based Compression Using High-Order Edge-Directed Interpolation
—This paper proposes a selective data pruning-based compression scheme to improve the rate-distortion relation of compressed images and video sequences. The original frames are p...
Dung Trung Vo, Joel Solé, Peng Yin, Cristin...
CASES
2005
ACM
15 years 6 months ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton
FFA
2010
139views more  FFA 2010»
15 years 2 months ago
Coset bounds for algebraic geometric codes
We develop new coset bounds for algebraic geometric codes. The bounds have a natural interpretation as an adversary threshold for algebraic geometric secret sharing schemes and le...
Iwan M. Duursma, Seungkook Park