570 search results - page 113 / 114 » On the complexity of distributed graph coloring |
AI
2010
Springer
13 years 5 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
ISI
2006
Springer
13 years 5 months ago
2006
Springer
Since the September 11th terror attack at New York in 2001, the frequency of terror attacks around the world has been increasing and it draws more attention of the public. On Janua...
BMCBI
2005
13 years 5 months ago
2005
Background: To facilitate efficient selection and the prioritization of candidate complex disease susceptibility genes for association analysis, increasingly comprehensive annotat...
JSA
2000
13 years 5 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
KDD
2010
ACM
13 years 3 months ago
2010
ACM
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...