Sciweavers

121 search results - page 3 / 25
» A New Exam Scheduling Algorithm Using Graph Coloring
Sort
View
ICC
2007
IEEE
101views Communications» more  ICC 2007»
14 years 1 months ago
Transmission Scheduling in Sensor Networks via Directed Edge Coloring
— This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicast and broadcast communication. The algorith...
Maggie X. Cheng, Li Yin
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
13 years 11 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
13 years 8 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...
FOCS
2003
IEEE
14 years 20 days ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
ICIP
2009
IEEE
13 years 5 months ago
A hierarchical graph-based markovian clustering approach for the unsupervised segmentation of textured color images
In this paper, a new unsupervised hierarchical approach to textured color images segmentation is proposed. To this end, we have designed a two-step procedure based on a grey-scale...
Rachid Hedjam, Max Mignotte