Sciweavers

ICLP
2011
Springer
13 years 3 months ago
Minimizing the overheads of dependent {AND}-parallelism
Parallel implementations of programming languages need to control synchronization overheads. Synchronization is essential for ensuring the correctness of parallel code, yet it add...
Peter Wang, Zoltan Somogyi
GIS
2011
ACM
13 years 3 months ago
Embedding rivers in triangulated irregular networks with linear programming
Data conflation is a major issue in GIS: different geospatial data sets covering overlapping regions, possibly obtained from different sources and using different acquisition ...
Marc J. van Kreveld, Rodrigo I. Silveira
ECSQARU
2011
Springer
13 years 3 months ago
Constructing Dynamic Frames of Discernment in Cases of Large Number of Classes
Yousri Kessentini, Thomas Burger, Thierry Paquet
DM
2011
202views Education» more  DM 2011»
13 years 3 months ago
Two-ended regular median graphs
We show that regular median graphs of linear growth are the Cartesian product of finite hypercubes with the two-way infinite path. Such graphs are Cayley graphs and have only tw...
Wilfried Imrich, Sandi Klavzar
DM
2011
158views Education» more  DM 2011»
13 years 3 months ago
A survey of homogeneous structures
A relational first order structure is homogeneous if it is countable (possibly finite) and every isomorphism between finite substructures extends to an automorphism. This artic...
Dugald Macpherson
DM
2011
211views Education» more  DM 2011»
13 years 3 months ago
A generalization of plexes of Latin squares
A k-plex of a latin square is a collection of cells representing each row, column, and symbol precisely k times. The classic case of k = 1 is more commonly known as a transversal....
Kyle Pula
DLOG
2011
13 years 3 months ago
Module Extraction via Query Inseparability in OWL 2 QL
We show that deciding conjunctive query inseparability for OWL 2 QL ontologies is PSpace-hard and in ExpTime. We give polynomial-time (incomplete) algorithms and demonstrate by exp...
Boris Konev, Roman Kontchakov, Michel Ludwig, Thom...
DLOG
2011
13 years 3 months ago
Query Answering over SROIQ Knowledge Bases with SPARQL
W3C currently extends the SPARQL query language with so-called entailment regimes, which define how queries are evaluated using logical entailment relations. We describe a sound a...
Ilianna Kollia, Birte Glimm, Ian Horrocks
DLOG
2011
13 years 3 months ago
Local Closed World Semantics: Keep it simple, stupid!
A combination of open and closed-world reasoning (usually called local closed world reasoning) is a desirable capability of knowledge representation formalisms for Semantic Web app...
Adila Alfa Krisnadhi, Kunal Sengupta, Pascal Hitzl...