518 search results - page 17 / 104 » Beating a Random Assignment |
QSHINE
2005
IEEE
15 years 5 months ago
2005
IEEE
—A complete complementary code based direct sequence code division multiple access (CC/DS-CDMA) system has been proposed recently as a potential candidate for beyond third genera...
105
click to vote
SOFSEM
2010
Springer
15 years 8 months ago
2010
Springer
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
SIAMDM
2002
14 years 11 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
APPROX
2000
Springer
15 years 4 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
ICIP
2010
IEEE
14 years 9 months ago
2010
IEEE
In this paper, we propose to use 3D information to augment the Markov random field (MRF) model for object recognition. Conventional MRF for image-based object recognition usually ...