Sciweavers

3731 search results - page 228 / 747
» Reduct Generation in Information Systems
Sort
View
DATE
2005
IEEE
118views Hardware» more  DATE 2005»
16 years 24 days ago
Energy- and Performance-Driven NoC Communication Architecture Synthesis Using a Decomposition Approach
In this paper, we present a methodology for customized communication architecture synthesis that matches the communication requirements of the target application. This is an impor...
Ümit Y. Ogras, Radu Marculescu
EUROCRYPT
2004
Springer
16 years 17 days ago
Short Signatures Without Random Oracles
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
Dan Boneh, Xavier Boyen
LICS
2000
IEEE
15 years 11 months ago
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names
Concurrent ML is an extension of Standard ML with π-calculus-like primitives for multi-threaded programming. CML has a reduction semantics, but to date there has been no labelled...
Alan Jeffrey, Julian Rathke
PEPM
1994
ACM
15 years 11 months ago
Dictionary-Free Overloading by Partial Evaluation
One of the most novel features in the functional programming language Haskell is the system of type classes used to support a combination of overloading and polymorphism. Current ...
Mark P. Jones
APN
2008
Springer
15 years 9 months ago
A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A bounded Petri net is always provided in case it exists. Otherwise, the events ar...
Josep Carmona, Jordi Cortadella, Michael Kishinevs...