4865 search results - page 338 / 973 » The Complexity of Graph Connectivity |
303
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Most information extraction (IE) approaches have considered only static text corpora, over which we apply IE only once. Many real-world text corpora however are dynamic. They evol...
165
click to vote
COMPLEX
2009
Springer
16 years 1 months ago
2009
Springer
By introducing and analyzing a renormalization procedure, Song et al. [1] draw the conclusion that many complex networks exhibit self-repeating patterns on all length scales. First...
227
click to vote
AML
2011
15 years 1 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
179
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
201
click to vote
CIE
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...