Sciweavers

99 search results - page 11 / 20
» On the complexity of division and set joins in the relationa...
Sort
View
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 9 months ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...
JACM
2010
116views more  JACM 2010»
13 years 7 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
CCS
2006
ACM
14 years 26 days ago
Beyond separation of duty: an algebra for specifying high-level security policies
A high-level security policy states an overall requirement for a sensitive task. One example of a high-level security policy is a separation of duty policy, which requires a sensi...
Ninghui Li, Qihua Wang
IPPS
1998
IEEE
14 years 1 months ago
High Performance Linear Algebra Package LAPACK90
Abstract. LAPACK90 is a set of LAPACK90 subroutines which interfaces FORTRAN90 with LAPACK. All LAPACK driver subroutines including expert drivers and some LAPACK computationals ha...
Jack Dongarra, Jerzy Wasniewski
FOIS
2006
13 years 10 months ago
Formalizing Ontology Alignment and its Operations with Category Theory
An ontology alignment is the expression of relations between different ontologies. In order to view alignments independently from the language expressing ontologies and from the te...
Antoine Zimmermann, Markus Krötzsch, Jé...