Sciweavers

17298 search results - page 235 / 3460
» Abstract computing machines
Sort
View
112
Voted
CIE
2007
Springer
15 years 10 months ago
Computability and Incomputability
The conventional wisdom presented in most computability books and historical papers is that there were several researchers in the early 1930’s working on various precise defini...
Robert I. Soare
ICALT
2006
IEEE
15 years 10 months ago
A Model for Interoperability in Computer Supported Collaborative Learning
Computer Supported Collaborative Learning activities involve combination of complex software tools that often need to interoperate in a wider context of learning. This paper propo...
Georgios Kahrimanis, Andreas Papasalouros, Nikolao...
120
Voted
CORR
2010
Springer
88views Education» more  CORR 2010»
15 years 1 months ago
Infinite Time Cellular Automata: A Real Computation Model
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
Fabien Givors, Grégory Lafitte, Nicolas Oll...
148
Voted
MLG
2007
Springer
15 years 10 months ago
Support Computation for Mining Frequent Subgraphs in a Single Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt
IEEEARES
2009
IEEE
15 years 10 months ago
Investigating the Implications of Virtual Machine Introspection for Digital Forensics
— Researchers and practitioners in computer forensics currently must base their analysis on information that is either incomplete or produced by tools that may themselves be comp...
Kara L. Nance, Brian Hay, Matt Bishop