Sciweavers

52 search results - page 6 / 11
» dcc 2005
Sort
View
ALGORITHMICA
2005
149views more  ALGORITHMICA 2005»
13 years 7 months ago
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
Markus Bläser, Bodo Manthey
DCC
2005
IEEE
14 years 7 months ago
Two-Level Directory based Compression
In this paper we present a new dictionary-based preprocessing technique and its implementation called TWRT (Two-level Word Replacing Transformation). Our preprocessor uses several...
Przemyslaw Skibinski
DCC
2005
IEEE
14 years 1 months ago
Fast Index Assignment for Balanced N-Description Scalar Quantization
In this paper, we address the design of any number of balanced descriptions using multiple description scalar quantization(MDSQ), based on fast index assignment. The proposed sche...
Ivana Radulovic, Pascal Frossard
DCC
2005
IEEE
14 years 7 months ago
Signcryption with Non-interactive Non-repudiation
Signcryption [35] is a public key primitive that achieves the functionality of both an encryption scheme and a signature scheme simultaneously. It does this more efficiently than a...
John Malone-Lee
DCC
2005
IEEE
14 years 7 months ago
Support Weight Enumerators and Coset Weight Distributions of Isodual Codes
In this paper various methods for computing the support weight enumerators of binary, linear, even, isodual codes are described. It is shown that there exist relationships between...
Olgica Milenkovic