Sciweavers

328 search results - page 23 / 66
» Deterministic k-set structure
Sort
View
ECAL
2003
Springer
14 years 17 days ago
Contextual Random Boolean Networks
Abstract. We propose the use of Deterministic Generalized Asynchronous Random Boolean Networks [1] as models of contextual deterministic discrete dynamical systems. We show that ch...
Carlos Gershenson, Jan Broekaert, Diederik Aerts
FCT
2009
Springer
13 years 11 months ago
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...
Paul Hänsch, Michaela Slaats, Wolfgang Thomas
ESORICS
2008
Springer
13 years 9 months ago
A Distributed Implementation of the Certified Information Access Service
In this paper we consider the problem of securely outsourcing computation on private data. We present a protocol for securely distributing the computation of the data structures u...
Carlo Blundo, Emiliano De Cristofaro, Aniello Del ...
ACL
2006
13 years 8 months ago
Graph Transformations in Data-Driven Dependency Parsing
Transforming syntactic representations in order to improve parsing accuracy has been exploited successfully in statistical parsing systems using constituency-based representations...
Jens Nilsson, Joakim Nivre, Johan Hall
DLT
2008
13 years 8 months ago
On the Size Complexity of Rotating and Sweeping Automata
We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change di...
Christos A. Kapoutsis, Richard Královic, To...