Sciweavers

2150 search results - page 150 / 430
» On a restricted cross-intersection problem
Sort
View
128
Voted
ENTCS
2007
123views more  ENTCS 2007»
15 years 4 months ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...
120
Voted
PC
2000
100views Management» more  PC 2000»
15 years 4 months ago
Parallel optimisation algorithms for multilevel mesh partitioning
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...
Chris Walshaw, Mark Cross
136
Voted
PVLDB
2008
101views more  PVLDB 2008»
15 years 4 months ago
Output perturbation with query relaxation
Given a dataset containing sensitive personal information, a statistical database answers aggregate queries in a manner that preserves individual privacy. We consider the problem ...
Xiaokui Xiao, Yufei Tao
138
Voted
RR
2010
Springer
15 years 3 months ago
Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
Reinhard Pichler, Axel Polleres, Sebastian Skritek...
120
Voted
LPAR
2010
Springer
15 years 2 months ago
SAT Encoding of Unification in EL
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have sho...
Franz Baader, Barbara Morawska