121 search results - page 12 / 25 » A New Exam Scheduling Algorithm Using Graph Coloring |
LCPC
1994
Springer
13 years 11 months ago
1994
Springer
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
We propose a new solution to the problem of bilayer video segmentation in terms of both, hardware design and algorithmic solution. At the data acquisition stage, we combine color ...
UAI
2004
13 years 8 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
APPROX
2004
Springer
14 years 24 days ago
2004
Springer
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...