2314 search results - page 133 / 463 » Minimal Partitions of a Graph |
152
click to vote
ALMOB
2006
15 years 3 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
115
Voted
TCAD
1998
15 years 3 months ago
1998
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
125
Voted
DATE
2003
IEEE
15 years 9 months ago
2003
IEEE
Abstract— This paper introduces a transformational design method which can be used to map code written in a high level source language, like C, to a coarse grain reconfigurable ...
133
Voted
SIROCCO
2010
15 years 5 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
123
click to vote
IPCO
2004
15 years 5 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...