27 search results - page 6 / 6 » Scaled Dimension and the Kolmogorov Complexity of Turing-Har... |
SIGMOD
2008
ACM
14 years 5 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
SIGSOFT
2003
ACM
13 years 10 months ago
2003
ACM
1 Step-wise refinement (SWR) asserts that complex programs can be derived from simple programs by progressively adding features. The length of a program specification is the number...