Sciweavers

6598 search results - page 300 / 1320
» Graph Theory with Applications
Sort
View
SEMWEB
2007
Springer
16 years 22 days ago
RDFSync: Efficient Remote Synchronization of RDF Models
In this paper we describe RDFSync, a methodology for efficient synchronization and merging of RDF models. RDFSync is based on decomposing a model into Minimum Self-Contained graphs...
Giovanni Tummarello, Christian Morbidoni, Reto Bac...
IAT
2009
IEEE
15 years 10 months ago
Efficient Distributed Bayesian Reasoning via Targeted Instantiation of Variables
Abstract--This paper is focusing on exact Bayesian reasoning in systems of agents, which represent weakly coupled processing modules supporting collaborative inference through mess...
Patrick de Oude, Gregor Pavlin
JGT
2008
69views more  JGT 2008»
15 years 6 months ago
List colorings with measurable sets
The measurable list chromatic number of a graph G is the smallest number such that if each vertex v of G is assigned a set L(v) of measure in a fixed atomless measure space, the...
Jan Hladký, Daniel Král, Jean-S&eacu...
CORR
2002
Springer
144views Education» more  CORR 2002»
15 years 6 months ago
Polynomial Time Data Reduction for Dominating Set
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
Jochen Alber, Michael R. Fellows, Rolf Niedermeier
TRIER
2002
15 years 6 months ago
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
Markus Müller-Olm, Helmut Seidl