Sciweavers

CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 4 months ago
Asynchronous iterative computations with Web information retrieval structures: The PageRank case
Giorgios Kollias, Efstratios Gallopoulos, Daniel B...
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 4 months ago
Authorised Translations of Electronic Documents
A concept is proposed to extend authorised translations of documents to electronically signed, digital documents. Central element of the solution is an electronic seal, embodied a...
Jan Piechalski, Andreas U. Schmidt
CORR
2006
Springer
97views Education» more  CORR 2006»
13 years 4 months ago
Trusted Computing in Mobile Action
Due to the convergence of various mobile access technologies like UMTS, WLAN, and WiMax the need for a new supporting infrastructure arises. This infrastructure should be able to ...
Nicolai Kuntze, Andreas U. Schmidt
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 4 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 4 months ago
Enabling user-driven Checkpointing strategies in Reverse-mode Automatic Differentiation
This paper presents a new functionality of the Automatic Differentiation (AD) Tool tapenade. tapenade generates adjoint codes which are widely used for optimization or inverse prob...
Laurent Hascoët, Mauricio Araya-Polo
CORR
2006
Springer
146views Education» more  CORR 2006»
13 years 4 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 4 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
CORR
2006
Springer
163views Education» more  CORR 2006»
13 years 4 months ago
Finding roots of polynomials over finite fields
In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...
Sergei V. Fedorenko, Peter Vladimirovich Trifonov
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 4 months ago
A constructive and unifying framework for zero-bit watermarking
In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in a piece of content. The watermark detector checks ...
Teddy Furon
CORR
2006
Springer
72views Education» more  CORR 2006»
13 years 4 months ago
A secure archive for Voice-over-IP conversations
An efficient archive securing the integrity of VoIP-based two-party conversations is presented. The solution is based on chains of hashes and continuously chained electronic signa...
Christian Hett, Nicolai Kuntze, Andreas U. Schmidt