803 search results - page 58 / 161 » Independence in Direct-Product Graphs |
87
Voted
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
COMBINATORICA
2007
15 years 21 days ago
2007
What is the maximum possible number, f3(n), of vectors of length n over {0, 1, 2} such that the Hamming distance between every two is even? What is the maximum possible number, g3...
204
click to vote
ICDE
2001
IEEE
16 years 2 months ago
2001
IEEE
Current workflow management technology does not provide adequate means for inter-workflow coordination as concurrently executing workflows are considered completely independent. W...
95
Voted
DAM
2008
15 years 23 days ago
2008
We study the combinatorial problem of finding an arrangement of distinct integers into the ddimensional N-cube so that the maximal variance of the numbers on each -dimensional sec...
IM
2007
15 years 18 days ago
2007
We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (...