383 search results - page 48 / 77 » A Bound on the Total Chromatic Number |
CRYPTO
2012
Springer
12 years 24 days ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
GLOBECOM
2008
IEEE
14 years 4 months ago
2008
IEEE
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...
ICMCS
1999
IEEE
14 years 2 months ago
1999
IEEE
In this paper, we propose a buffer cache algorithm to build a cost effective storage server for real time news objects. In a News On Demand Server, the number of concurrent stream...
TSP
2008
13 years 10 months ago
2008
We consider sequential regression of individual sequences under the square error loss. Using a competitive algorithm framework, we construct a sequential algorithm that can achieve...
MST
2010
13 years 8 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...