Sciweavers

1922 search results - page 357 / 385
» ie 2007
Sort
View
CSL
2007
Springer
15 years 3 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ļ...
Arnold Beckmann
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
15 years 3 months ago
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
DFG
2007
Springer
15 years 3 months ago
PointCloudXplore 2: Visual Exploration of 3D Gene Expression
: To better understand how developmental regulatory networks are defined in the genome sequence, the Berkeley Drosophila Transcription Network Project (BDNTP) has developed a suit...
Oliver Rübel, Gunther H. Weber, Min-Yu Huang,...
EMSOFT
2007
Springer
15 years 3 months ago
Methods for multi-dimensional robustness optimization in complex embedded systems
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
Arne Hamann, Razvan Racu, Rolf Ernst
EVOW
2007
Springer
15 years 3 months ago
Overcompressing JPEG Images with Evolution Algorithms
Abstract. Overcompression is the process of post-processing compressed images to gain either further size reduction or improved quality. This is made possible by the fact that the ...
Jacques Lévy Véhel, Franklin Mendivi...