Sciweavers

544 search results - page 60 / 109
» What cannot be computed locally!
Sort
View
107
Voted
MFCS
2004
Springer
15 years 6 months ago
Captive Cellular Automata
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
Guillaume Theyssier
FSTTCS
2009
Springer
15 years 7 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
118
Voted
IJDE
2006
95views more  IJDE 2006»
15 years 17 days ago
Exploiting the Rootkit Paradox with Windows Memory Analysis
Rootkits are malicious programs that silently subvert an operating system to hide an intruder's activities. Although there are a number of tools designed to detect rootkits, ...
Jesse D. Kornblum
ASIACRYPT
2001
Springer
15 years 5 months ago
Fully Distributed Threshold RSA under Standard Assumptions
The aim of this article is to propose a fully distributed environment for the RSA scheme. What we have in mind is highly sensitive applications and even if we are ready to pay a pr...
Pierre-Alain Fouque, Jacques Stern
NIPS
1996
15 years 1 months ago
A Model of Recurrent Interactions in Primary Visual Cortex
A general feature of the cerebral cortex is its massive interconnectivity-ithas been estimatedanatomically 15 that cortical neurons receive on the order of 10,000 synapses, the ma...
Emanuel Todorov, Athanassios Siapas, David Somers