Sciweavers

3825 search results - page 704 / 765
» The Language of Time: A Reader
Sort
View
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 1 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 1 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
DATE
2004
IEEE
119views Hardware» more  DATE 2004»
15 years 1 months ago
MINCE: Matching INstructions Using Combinational Equivalence for Extensible Processor
Designing custom-extensible instructions for Extensible Processors1 is a computationally complex task because of the large design space. The task of automatically matching candida...
Newton Cheung, Sri Parameswaran, Jörg Henkel,...
BPM
2008
Springer
217views Business» more  BPM 2008»
14 years 11 months ago
Detecting Regulatory Compliance for Business Process Models through Semantic Annotations
A given business process may face a large number of regulatory obligations the process may or comply with. Providing tools and techniques through which an evaluation of the complia...
Guido Governatori, Jörg Hoffmann, Shazia Wasi...
CIKM
2008
Springer
14 years 11 months ago
Similarity cross-analysis of tag / co-tag spaces in social classification systems
Recent growth of social classification systems due to steadily increasing popularity has established a multitude of heterogeneous isolated, non-integrated, and non-interoperable t...
Steffen Oldenburg, Martin Garbe, Clemens H. Cap