241 search results - page 37 / 49 » Graphs, Hypergraphs and Hashing |
138
click to vote
ACTA
2007
15 years 2 months ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
173
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
131
Voted
SIGMOD
2011
ACM
14 years 4 months ago
2011
ACM
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
89
Voted
SEMWEB
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we describe RDFSync, a methodology for efficient synchronization and merging of RDF models. RDFSync is based on decomposing a model into Minimum Self-Contained graphs...
137
click to vote
IACR
2011
14 years 1 months ago
2011
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...