803 search results - page 53 / 161 » Independence in Direct-Product Graphs |
108
Voted
DATE
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract - Streaming applications are often implemented as task graphs. Currently, techniques exist to derive buffer capacities that guarantee satisfaction of a throughput constrai...
104
click to vote
ENTCS
2007
15 years 19 days ago
2007
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
97
Voted
JGT
2010
14 years 11 months ago
2010
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
152
click to vote
CSR
2011
Springer
14 years 4 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
203
Voted
SPAA
2012
ACM
13 years 3 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...