Sciweavers

3122 search results - page 488 / 625
» Storing Semistructured Data with STORED
Sort
View
DCC
1996
IEEE
15 years 10 months ago
On the Implementation of Minimum-Redundancy Prefix Codes
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
Alistair Moffat, Andrew Turpin
HPDC
1996
IEEE
15 years 10 months ago
On-Demand Hypermedia/Multimedia Service over Broadband Networks
In this paper we present a uni ed approach for delivering hypermedia/multimedia objects over broadband networks. Documents are stored in various multimedia servers, while the inli...
Christos Bouras, Vaggelis Kapoulas, D. Miras, Vagg...
FSE
1997
Springer
280views Cryptology» more  FSE 1997»
15 years 10 months ago
New Block Encryption Algorithm MISTY
We propose secret-key cryptosystems MISTY1 and MISTY2, which are block ciphers with a 128-bit key, a 64-bit block and a variable number of rounds. MISTY is a generic name for MISTY...
Mitsuru Matsui
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 10 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
MICRO
1994
IEEE
96views Hardware» more  MICRO 1994»
15 years 10 months ago
A fill-unit approach to multiple instruction issue
Multiple issue of instructions occurs in superscalar and VLIW machines. This paper investigates a third type of machine design, which combines the advantages of code compatibility...
Manoj Franklin, Mark Smotherman