1632 search results - page 37 / 327 » On special numberings of hypergraphs |
156
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
141
click to vote
DNA
2006
Springer
15 years 10 months ago
2006
Springer
Content-addressability is a fundamental feature of human memory underlying many associative information retrieval tasks. In contrast to location-based memory devices, content-addre...
183
click to vote
ACTA
2007
15 years 6 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...
144
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
142
click to vote
SIAMSC
2010
15 years 28 days ago
2010
We consider two-dimensional partitioning of general sparse matrices for parallel sparse matrix-vector multiply operation. We present three hypergraph-partitioning-based methods, ea...