1274 search results - page 228 / 255 » New Proofs for |
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
ANOR
2005
13 years 8 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
JSC
2010
13 years 3 months ago
2010
Both Sequence and Context Unification generalize the same problem: Word Unification. Besides that, Sequence Unification solves equations between unranked terms involving sequence ...
STOC
2012
ACM
11 years 11 months ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
HPDC
2010
IEEE
13 years 9 months ago
2010
IEEE
Clusters are mostly used through Resources Management Systems (RMS) with a static allocation of resources for a bounded amount of time. Those approaches are known to be insufficie...