52 search results - page 8 / 11 » On the computational complexity of strong edge coloring |
SAC
2005
ACM
13 years 11 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
ICCV
2001
IEEE
14 years 8 months ago
2001
IEEE
?This paper presents a computational paradigm called Data-Driven Markov Chain Monte Carlo (DDMCMC) for image segmentation in the Bayesian statistical framework. The paper contribut...
FOCS
1999
IEEE
13 years 10 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
ICMCS
2000
IEEE
13 years 10 months ago
2000
IEEE
: In the process of transmission of digital encoded video bit streams over physical network, the data is corrupted by random bit errors, which has a several effect on the decoded v...
AUSDM
2008
Springer
13 years 8 months ago
2008
Springer
Complex network analysis involves the study of the properties of various real world networks. In this broad field, research on community structures forms an important sub area. Th...