241 search results - page 35 / 49 » Graphs, Hypergraphs and Hashing |
113
click to vote
ENTCS
2008
15 years 1 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
128
Voted
IANDC
2007
15 years 1 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
132
click to vote
BMCBI
2006
15 years 1 months ago
2006
Background: Structural analysis of cellular interaction networks contributes to a deeper understanding of network-wide interdependencies, causal relationships, and basic functiona...
126
Voted
STOC
2010
ACM
15 years 5 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
125
Voted
JIKM
2011
14 years 4 months ago
2011
Abstract. This paper presents a novel approach for extracting personal data and automatically generating Personal Data Reports (PDRs) from relational databases. Such PDRs can be us...