4009 search results - page 107 / 802 » Clustering on Complex Graphs |
127
Voted
MFCS
1997
Springer
15 years 7 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a signiļ¬cant simpliļ¬...
94
Voted
IWPC
2010
IEEE
15 years 2 months ago
2010
IEEE
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...
112
Voted
WIOPT
2010
IEEE
15 years 2 months ago
2010
IEEE
āK-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
161
Voted
UAI
2003
15 years 5 months ago
2003
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at ļ¬nding irregularlyshaped clusters in data. The input to...
95
Voted
APAL
2008
15 years 3 months ago
2008
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...