Sciweavers

217 search results - page 10 / 44
» Elimination Graphs
Sort
View
ICPR
2004
IEEE
14 years 8 months ago
Graph Method for Generating Affine Moment Invariants
A general method of systematic derivation of affine moment invariants of any weights and orders is introduced. Each invariant is expressed by its generating graph. Techniques for ...
Jan Flusser, Tomás Suk
ALGORITHMICA
2004
112views more  ALGORITHMICA 2004»
13 years 7 months ago
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
Anne Berry, Jean R. S. Blair, Pinar Heggernes, Bar...
ICCAD
1999
IEEE
96views Hardware» more  ICCAD 1999»
13 years 12 months ago
Implication graph based domino logic synthesis
In this paper, we present a new approach to the problem of inverter elimination in domino logic synthesis. A small piece of static CMOS logic is introduced to the circuit to avoid...
Ki-Wook Kim, C. L. Liu, Sung-Mo Kang
SCAM
2005
IEEE
14 years 1 months ago
Control Flow Graph Reconstruction for Assembly Language Programs with Delayed Instructions
Most software for embedded systems, including digital signal processing systems, is coded in assembly language. For both understanding the software and for reverse compiling it to...
Nerina Bermudo, Andreas Krall, R. Nigel Horspool
CASES
2007
ACM
13 years 11 months ago
An optimistic and conservative register assignment heuristic for chordal graphs
This paper presents a new register assignment heuristic for procedures in SSA Form, whose interference graphs are chordal; the heuristic is called optimistic chordal coloring (OCC...
Philip Brisk, Ajay K. Verma, Paolo Ienne