Sciweavers

3663 search results - page 691 / 733
» Problems in the ontology of computer programs
Sort
View
FOCS
2009
IEEE
15 years 4 months ago
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veri...
Yi Deng, Vipul Goyal, Amit Sahai
MHCI
2009
Springer
15 years 4 months ago
Hoverflow: exploring around-device interaction with IR distance sensors
By equipping a mobile device with distance sensing capabilities, we aim to expand the interaction possibilities of mobile and wearable devices beyond the confines of the physical ...
Sven G. Kratz, Michael Rohs
SASO
2008
IEEE
15 years 4 months ago
Integer Gradient for Cellular Automata: Principle and Examples
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
Luidnel Maignan, Frédéric Gruau
IPPS
2007
IEEE
15 years 4 months ago
Experience of Optimizing FFT on Intel Architectures
Automatic library generators, such as ATLAS [11], Spiral [8] and FFTW [2], are promising technologies to generate efficient code for different computer architectures. The library...
Daniel Orozco, Liping Xue, Murat Bolat, Xiaoming L...
SASO
2007
IEEE
15 years 4 months ago
Self-Adaptive Systems for Information Survivability: PMOP and AWDRAT
Information systems form the backbones of the critical infrastructures of modern societies. Unfortunately, these systems are highly vulnerable to attacks that can result in enormo...
Howard E. Shrobe, Robert Laddaga, Robert Balzer, N...