331 search results - page 16 / 67 » Comparing Reductions to NP-Complete Sets |
EDBT
2012
ACM
11 years 9 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
TAL
2010
Springer
13 years 5 months ago
2010
Springer
Mihalcea [1] discusses self-training and co-training in the context of word sense disambiguation and shows that parameter optimization on individual words was important to obtain g...
ICCAD
2004
IEEE
14 years 4 months ago
2004
IEEE
We extend the APlace wirelength-driven standard-cell analytic placement framework of [21] to address timing-driven and mixedsize (“boulders and dust”) placement. Compared with...
FPL
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents an automated partitioning strategy to divide a design into a set of partitions based on design hierarchy information. While the primary objective is to use the...
ITA
2002
13 years 7 months ago
2002
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the be...