Sciweavers

4171 search results - page 686 / 835
» Choice numbers of graphs
Sort
View
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
16 years 9 hour ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...
EMSOFT
2005
Springer
16 years 5 hour ago
High performance annotation-aware JVM for Java cards
Early applications of smart cards have focused in the area of personal security. Recently, there has been an increasing demand for networked, multi-application cards. In this new ...
Ana Azevedo, Arun Kejariwal, Alexander V. Veidenba...
FOSSACS
2005
Springer
16 years 2 hour ago
Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
Samy Abbes, Albert Benveniste
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 12 months ago
Parameterized versus generative representations in structural design: an empirical comparison
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...
Rafal Kicinger, Tomasz Arciszewski, Kenneth A. De ...
LCPC
2005
Springer
15 years 12 months ago
Loop Selection for Thread-Level Speculation
Thread-level speculation (TLS) allows potentially dependent threads to speculatively execute in parallel, thus making it easier for the compiler to extract parallel threads. Howeve...
Shengyue Wang, Xiaoru Dai, Kiran Yellajyosula, Ant...