Sciweavers

3775 search results - page 719 / 755
» The Expression Problem Revisited
Sort
View
LPAR
2001
Springer
15 years 7 months ago
Boolean Functions for Finite-Tree Dependencies
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Pa...
ASYNC
2000
IEEE
122views Hardware» more  ASYNC 2000»
15 years 7 months ago
DUDES: A Fault Abstraction and Collapsing Framework for Asynchronous Circuits
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...
Philip P. Shirvani, Subhasish Mitra, Jo C. Ebergen...
139
Voted
CPM
2000
Springer
177views Combinatorics» more  CPM 2000»
15 years 7 months ago
Identifying and Filtering Near-Duplicate Documents
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
Andrei Z. Broder
169
Voted
CSFW
1999
IEEE
15 years 7 months ago
Athena: A New Efficient Automatic Checker for Security Protocol Analysis
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...
Dawn Xiaodong Song
118
Voted
SIGGRAPH
1999
ACM
15 years 7 months ago
Physically Based Motion Transformation
We introduce a novel algorithm for transforming character animation sequences that preserves essential physical properties of the motion. By using the spacetime constraints dynami...
Zoran Popovic, Andrew P. Witkin