515 search results - page 19 / 103 » A Reduced Complexity Algorithm for Minimizing N-Detect Tests |
EGH
2009
Springer
13 years 6 months ago
2009
Springer
Stream compaction is a common parallel primitive used to remove unwanted elements in sparse data. This allows highly parallel algorithms to maintain performance over several proce...
VLSID
2003
IEEE
14 years 8 months ago
2003
IEEE
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
JMLR
2002
13 years 8 months ago
2002
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
STACS
2007
Springer
14 years 2 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
DAC
2000
ACM
14 years 9 months ago
2000
ACM
In this paper we describe an area efficient power minimization scheme "Control Generated ClockingI` that saves significant amounts of power in datapath registers and clock dr...