Sciweavers

624 search results - page 70 / 125
» Test set compaction algorithms for combinational circuits
Sort
View
CIIA
2009
15 years 5 months ago
Physical Synthesis for CPLD Architectures
In this paper, we present a new synthesis feature namely, "Xor matching", and the foldback product term synthesis for Complex Programmable Logic Devices (CPLD) architectu...
Sid-Ahmed Senouci
DAC
1998
ACM
16 years 5 months ago
Efficient Coloring of a Large Spectrum of Graphs
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
Darko Kirovski, Miodrag Potkonjak
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 4 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
BMCBI
2005
126views more  BMCBI 2005»
15 years 4 months ago
An algorithm for automatic evaluation of the spot quality in two-color DNA microarray experiments
Background: Although DNA microarray technologies are very powerful for the simultaneous quantitative characterization of thousands of genes, the quality of the obtained experiment...
Eugene Novikov, Emmanuel Barillot
SC
2004
ACM
15 years 9 months ago
Optimal File-Bundle Caching Algorithms for Data-Grids
The file-bundle caching problem arises frequently in scientific applications where jobs process several files concurrently. Consider a host system in a data-grid that maintains...
Ekow J. Otoo, Doron Rotem, Alexandru Romosan