976 search results - page 74 / 196 » Evaluating Adversarial Partitions |
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
IPPS
1999
IEEE
14 years 1 months ago
1999
IEEE
By managing network resources at compile time, the compiled communication technique greatly improves the communication performance for communication patterns that are known at com...
ISPD
1998
ACM
14 years 1 months ago
1998
ACM
From 1985-1993, the MCNC regularly introduced and maintained circuit benchmarks for use by the Design Automation community. However, during the last five years, no new circuits h...
ICA
2007
Springer
14 years 24 days ago
2007
Springer
Deriving a thematically meaningful partition of an unlabeled document corpus is a challenging task. In this context, the use of document representations based on latent thematic ge...
AAAI
2008
13 years 11 months ago
2008
Complex graphs, in which multi-type nodes are linked to each other, frequently arise in many important applications, such as Web mining, information retrieval, bioinformatics, and...