Sciweavers

2496 search results - page 300 / 500
» On covering by translates of a set
Sort
View
SEMWEB
2005
Springer
16 years 2 days ago
Combining RDF and Part of OWL with Rules: Semantics, Decidability, Complexity
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
Herman J. ter Horst
ICML
2004
IEEE
16 years 22 hour ago
Towards tight bounds for rule learning
While there is a lot of empirical evidence showing that traditional rule learning approaches work well in practice, it is nearly impossible to derive analytical results about thei...
Ulrich Rückert, Stefan Kramer
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
16 years 3 hour ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
WG
2004
Springer
15 years 12 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
INFOCOM
2003
IEEE
15 years 12 months ago
Robust Location Detection in Emergency Sensor Networks
— We propose a new framework for providing robust location detection in emergency response systems, based on the theory of identifying codes. The key idea of this approach is to ...
Saikat Ray, Rachanee Ungrangsi, Francesco De Pelle...