3211 search results - page 614 / 643 » On the Grundy Number of a Graph |
188
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
188
Voted
AUSDM
2007
Springer
16 years 28 days ago
2007
Springer
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
172
Voted
CRYPTO
2007
Springer
16 years 28 days ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
202
Voted
ESA
2007
Springer
16 years 28 days ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
208
click to vote
RECOMB
2007
Springer
16 years 26 days ago
2007
Springer
Publicly-available data sets provide detailed and large-scale information on multiple types of molecular interaction networks in a number of model organisms. These multi-modal univ...