439 search results - page 24 / 88 » Engineering Comparators for Graph Clusterings |
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ļ¬...
ICCAD
2007
IEEE
15 years 6 months ago
2007
IEEE
ā We present a new linear time technique to compute criticality information in a timing graph by dividing it into āzonesā. Errors in using tightness probabilities for critica...
IEEEPACT
2000
IEEE
15 years 2 months ago
2000
IEEE
Recent research suggests that DSM clusters can beneļ¬t from parallel coherence controllers. Parallel controllers require address partitioning and synchronization to avoid handlin...
JPDC
2010
14 years 8 months ago
2010
āWe present the design and implementation of a parallel exact inference algorithm on the Cell Broadband Engine (Cell BE). Exact inference is a key problem in exploring probabilis...
JODS
2007
14 years 10 months ago
2007
This paper describes a theoretical framework for inducing knowledge from incomplete data sets. The general framework can be used with any formalism based on a lattice structure. It...