836 search results - page 94 / 168 » Orthogonal Colorings of Graphs |
107
click to vote
DAC
2009
ACM
15 years 8 months ago
2009
ACM
For a computing system to be trusted, it is equally important to verify that the system performs no more and no less functionalities than desired. Traditional testing and verifica...
169
click to vote
CRV
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we propose a novel method for the automatic segmentation of a foreground layer from a natural scene in real time by fusing infrared, color and edge information. Thi...
127
click to vote
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We...
129
Voted
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
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...
110
click to vote
ECRTS
2007
IEEE
15 years 8 months ago
2007
IEEE
Conventionally, the use of virtual memory in real-time systems has been avoided, the main reason being the difficulties it provides to timing analysis. However, there is a trend ...