Sciweavers

921 search results - page 15 / 185
» Expressing Computational Complexity in Constructive Type The...
Sort
View
KES
1998
Springer
13 years 12 months ago
Attractor systems and analog computation
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
Hava T. Siegelmann, Shmuel Fishman
MFCS
2004
Springer
14 years 1 months ago
Complexity of Decision Problems for Simple Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Wim Martens, Frank Neven, Thomas Schwentick
VLDB
1991
ACM
179views Database» more  VLDB 1991»
13 years 11 months ago
A Relationship Mechanism for a Strongly Typed Object-Oriented Database Programming Language
Object-oriented data models are receiving wide attention since they provide expressive ionmechanismsto model naturally and directly both structural and behavioral aspectsof comple...
Antonio Albano, Giorgio Ghelli, Renzo Orsini
DAGSTUHL
2001
13 years 9 months ago
Constructive Foundations for Featherweight Java
In this paper we present a recursion-theoretic denotational semantics for Featherweight Java. Our interpretation is based on a formalization of the object model of Castagna, Ghelli...
Thomas Studer
RIVF
2007
13 years 9 months ago
Generalized Percolation Processes Using Pretopology Theory
Abstract— We propose in this paper a generalization of percolation processes in Z2 using the pretopology theory. We formalize the notion of neighborhood by extending it to the co...
Soufian Ben Amor, V. Levorato, Ivan Lavallé...