Sciweavers

3172 search results - page 123 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
BTW
2007
Springer
136views Database» more  BTW 2007»
16 years 18 days ago
System P: Completeness-driven Query Answering in Peer Data Management Systems
Abstract: Peer data management systems (PDMS) are a highly dynamic, decentralized infrastructure for large-scale data integration. They consist of a dynamic set of autonomous peers...
Armin Roth, Felix Naumann
SSD
2001
Springer
128views Database» more  SSD 2001»
15 years 11 months ago
Creating Representations for Continuously Moving Regions from Observations
Recently there is much interest in moving objects databases, and data models and query languages have been proposed offering data types such as moving point and moving region toge...
Erlend Tøssebro, Ralf Hartmut Güting
CORR
2007
Springer
69views Education» more  CORR 2007»
15 years 6 months ago
Lossless Representation of Graphs using Distributions
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
Mireille Boutin, Gregor Kemper
AAAI
2004
15 years 7 months ago
Loop Formulas for Circumscription
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...
Joohyung Lee, Fangzhen Lin
UAI
2001
15 years 7 months ago
A Logic for Reasoning about Upper Probabilities
We present a propositional logic to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability ...
Joseph Y. Halpern, Riccardo Pucella