383 search results - page 25 / 77 » A Bound on the Total Chromatic Number |
NETWORKS
2010
13 years 8 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
FSE
2010
Springer
14 years 1 months ago
2010
Springer
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled a...
APPROX
2010
Springer
13 years 12 months ago
2010
Springer
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
INFOCOM
2009
IEEE
14 years 5 months ago
2009
IEEE
Abstract—This paper is about designing optimal highthroughput hashing schemes that minimize the total number of memory accesses needed to build and access an hash table. Recent s...
GLOBECOM
2006
IEEE
14 years 4 months ago
2006
IEEE
— We study the downlink coverage of a base station terminal (BST), which has access to a relay node. Continuing a previous study in which the BST is assumed to provide a variable...