1909 search results - page 58 / 382 » Generalized Filtering Decomposition |
112
click to vote
ICCAD
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper presents new methods for restructuring logic networks based on fast Boolean techniques. The basis for these are 1) a cut based view of a logic network, 2) exploiting th...
114
Voted
ICCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Frames, i.e., recursive attribute-value structures, are a general format for the decomposition of lexical concepts. Attributes assign unique values to objects and thus de...
151
click to vote
ITCC
2002
IEEE
15 years 7 months ago
2002
IEEE
: Since modern programmable devices contain embedded memory blocks, there exists a possibility to implement Finite State Machines (FSM) using such blocks. The size of the memory av...
127
Voted
ISSAC
1995
Springer
15 years 6 months ago
1995
Springer
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
123
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...