1538 search results - page 171 / 308 » Spectral Techniques in Graph Algorithms |
136
click to vote
BMCBI
2007
15 years 3 months ago
2007
Background: Microarrays have become extremely useful for analysing genetic phenomena, but establishing a relation between microarray analysis results (typically a list of genes) a...
147
click to vote
SAT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
129
click to vote
DAC
2006
ACM
16 years 4 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
141
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
Multiple memory module architecture enjoys higher memory access bandwidth and thus higher performance. Two key problems in gaining high performance in this kind of architecture ar...
137
click to vote
ISCAS
2002
IEEE
15 years 8 months ago
2002
IEEE
Multiple memory module architecture offers higher performance by providing potentially doubled memory bandwidth. Two key problems in gaining high performance in this kind of archi...