Sciweavers

959 search results - page 77 / 192
» New Techniques for Algorithm Portfolio Design
Sort
View
LCTRTS
2004
Springer
15 years 5 months ago
Flattening statecharts without explosions
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
Andrzej Wasowski
DELTA
2004
IEEE
15 years 3 months ago
Arithmetic Transformations to Maximise the Use of Compressor Trees
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
Paolo Ienne, Ajay K. Verma
DAC
1995
ACM
15 years 3 months ago
Power Estimation in Sequential Circuits
Abstract A new method for power estimation in sequential circuits is presented that is based on a statistical estimation technique. By applying randomly generated input sequences t...
Farid N. Najm, Shashank Goel, Ibrahim N. Hajj
CTRSA
2008
Springer
109views Cryptology» more  CTRSA 2008»
15 years 1 months ago
Super-Efficient Verification of Dynamic Outsourced Databases
We develop new algorithmic and cryptographic techniques for authenticating the results of queries over databases that are outsourced to an untrusted responder. We depart from previ...
Michael T. Goodrich, Roberto Tamassia, Nikos Trian...
ICMCS
2006
IEEE
107views Multimedia» more  ICMCS 2006»
15 years 5 months ago
A Flexible Content-Based Approach to Adaptive Image Compression
Recent research in image compression has focused on lossy compression algorithms. However, the baseline implementations of such algorithms generally use a universal quantization p...
Alexander Wong, William Bishop