Sciweavers

DNA
2011
Springer
213views Bioinformatics» more  DNA 2011»
12 years 2 months ago
Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes
Sticker complexes are a a formal graph-based data model for a restricted class of DNA complexes, motivated by potential applications to databases. This data model allows for a pure...
Robert Brijder, Joris J. M. Gillis, Jan Van den Bu...
COCO
2011
Springer
221views Algorithms» more  COCO 2011»
12 years 2 months ago
Non-uniform ACC Circuit Lower Bounds
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
Ryan Williams
DLOG
2011
12 years 6 months ago
Dependencies to Optimize Ontology Based Data Access
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...
Mariano Rodriguez-Muro, Diego Calvanese
ATAL
2010
Springer
13 years 3 months ago
Improving DPOP with function filtering
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
Ismel Brito, Pedro Meseguer
FSTTCS
2005
Springer
13 years 8 months ago
Fixpoint Logics on Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey