Sciweavers

4539 search results - page 403 / 908
» Approaches to Compute Workflow Complexity
Sort
View
IWDW
2009
Springer
15 years 11 months ago
Fast Embedding Technique for Dirty Paper Trellis Watermarking
This paper deals with the improvement of the Dirty Paper Trellis Code (DPTC) watermarking algorithm. This watermarking algorithm is known to be one of the best among the high rate ...
Marc Chaumont
EUROMICRO
2000
IEEE
15 years 11 months ago
Formal Coverification of Embedded Systems Using Model Checking
The complexity of embedded systems is increasing rapidly. In consequence, new verification techniques that overcome the limitations of traditional methods and are suitable for har...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
181
Voted
CRYPTO
1989
Springer
163views Cryptology» more  CRYPTO 1989»
15 years 11 months ago
Undeniable Signatures
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...
David Chaum, Hans Van Antwerpen
CEC
2009
IEEE
15 years 10 months ago
Search methodologies for efficient planetary site selection
Landing on distant planets is always a challenging task due to the distance and hostile environments found. In the design of autonomous hazard avoidance systems we find the particu...
Luís F. Simões, Tiago C. Pais, Rita ...
ASPDAC
2008
ACM
135views Hardware» more  ASPDAC 2008»
15 years 8 months ago
Analog circuit simulation using range arithmetics
The impact of parameter variations in integrated analog circuits is usually analyzed by Monte Carlo methods with a high number of simulation runs. Few approaches based on interval ...
Darius Grabowski, Markus Olbrich, Erich Barke