Sciweavers

5214 search results - page 794 / 1043
» The Online Specialization Problem
Sort
View
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
16 years 25 days ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
LFCS
2007
Springer
16 years 24 days ago
Model Checking Knowledge and Linear Time: PSPACE Cases
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
Kai Engelhardt, Peter Gammie, Ron van der Meyden
SEMWEB
2007
Springer
16 years 24 days ago
Who the FOAF knows Alice? A Needed Step Toward Semantic Web Pipes
In this paper we take a view from the bottom to RDF(S) reasoning. We discuss some issues and requirements on reasoning towards effectively building Semantic Web Pipes, aggregating...
Christian Morbidoni, Axel Polleres, Giovanni Tumma...
VISUAL
2007
Springer
16 years 23 days ago
Potentialities of Chorems as Visual Summaries of Geographic Databases Contents
Chorems are schematized representations of territories, and so they can represent a good visual summary of spatial databases. Indeed for spatial decision-makers, it is more importa...
Vincenzo Del Fatto, Robert Laurini, Karla Lopez, R...
WDAG
2007
Springer
82views Algorithms» more  WDAG 2007»
16 years 23 days ago
The Space Complexity of Unbounded Timestamps
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
Faith Ellen, Panagiota Fatourou, Eric Ruppert