2004 search results - page 129 / 401 » Sampling from large graphs |
130
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
114
click to vote
KDD
2002
ACM
16 years 3 months ago
2002
ACM
This paper promotes the use of supervised machine learning in laboratory settings where chemists have a large number of samples to test for some property, and are interested in id...
107
click to vote
FFA
2006
15 years 3 months ago
2006
Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative La...
118
click to vote
JUCS
2007
15 years 3 months ago
2007
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...
126
click to vote
DAC
2009
ACM
16 years 4 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...