Sciweavers

1124 search results - page 154 / 225
» Refined quorum systems
Sort
View
ACTA
2005
104views more  ACTA 2005»
15 years 6 months ago
Subtyping for session types in the pi calculus
Extending the pi calculus with the session types proposed by Honda et al. allows high-level specifications of structured patterns of communication, such as client-server protocols,...
Simon J. Gay, Malcolm Hole
APAL
2005
107views more  APAL 2005»
15 years 6 months ago
Uniform Heyting arithmetic
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
Ulrich Berger
SQJ
2002
90views more  SQJ 2002»
15 years 6 months ago
Critical Analysis of the PIE Testability Technique
Abstract. The work of Voas and colleagues has introduced, refined and applied the propagation, infection and execution (PIE) analysis technique for measuring testability of program...
Zuhoor A. Al-Khanjari, Martin R. Woodward, Haider ...
AUGHUMAN
2010
15 years 4 months ago
The Reading Glove: designing interactions for object-based tangible storytelling
In this paper we describe a prototype Tangible User Interface (TUI) for interactive storytelling that explores the semantic properties of tangible interactions using the fictional...
Joshua Tanenbaum, Karen Tanenbaum, Alissa Nicole A...
ICCV
2009
IEEE
16 years 11 months ago
What is the Best Multi-Stage Architecture for Object Recognition?
In many recent object recognition systems, feature extraction stages are generally composed of a filter bank, a non-linear transformation, and some sort of feature pooling layer...
Kevin Jarrett, Koray Kavukcuoglu, Marc’Aurelio R...