Sciweavers

3005 search results - page 515 / 601
» Logical Information Systems: from Taxonomies to Logics
Sort
View
MST
2006
129views more  MST 2006»
15 years 1 months ago
Reachability Problems on Regular Ground Tree Rewriting Graphs
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
Christof Löding
VLDB
2002
ACM
141views Database» more  VLDB 2002»
15 years 1 months ago
A Multi-version Cache Replacement and Prefetching Policy for Hybrid Data Delivery Environments
This paper introduces MICP, a novel multiversion integrated cache replacement and prefetching algorithm designed for efficient cache and transaction management in hybrid data deli...
André Seifert, Marc H. Scholl
NC
2010
179views Neural Networks» more  NC 2010»
15 years 11 days ago
Representation before computation
My main objective is to point out a fundamental weakness in the conventional conception of computation and suggest a promising way out. This weakness is directly related to a gross...
Lev Goldfarb
IJACTAICIT
2010
200views more  IJACTAICIT 2010»
14 years 11 months ago
An Intelligent Framework for Natural Object Identification in Images
Human superiority over computers in identifying natural objects like clouds, water, grass etc. comes from two capabilities: the capability to maintain a growing knowledge base per...
Aasia Khanum
SLP
1994
77views more  SLP 1994»
15 years 3 months ago
Modal Event Calculus
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
Iliano Cervesato, Luca Chittaro, Angelo Montanari