2746 search results - page 90 / 550 » Bisubmodular Function Minimization |
123
click to vote
ICCAD
1993
IEEE
15 years 7 months ago
1993
IEEE
In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depth-optimal FlowMap algorithm. The new algorithm, na...
121
Voted
ASPDAC
2005
ACM
15 years 5 months ago
2005
ACM
- We present fast algorithms to synthesize exact minimal reversible circuits for various types of gates and costs. By reducing reversible logic synthesis problems to group theory p...
130
click to vote
CGF
2008
15 years 3 months ago
2008
In this paper we propose a new kind of Hermite interpolation on arbitrary domains, matching derivative data of arbitrary order on the boundary. The basic idea stems from an interp...
119
Voted
DM
2006
15 years 3 months ago
2006
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
116
click to vote
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
We present a novel method for state minimization of incompletely-specified finite state machines. Where classic methods simply minimize the number of states, ours directly addre...