Sciweavers

1149 search results - page 16 / 230
» Minimally non-Pfaffian graphs
Sort
View
DM
2006
92views more  DM 2006»
13 years 9 months ago
Minimal triangulations of graphs: A survey
Any given graph can be embedded in a chordal graph by adding edges, and the resulting chordal graph is called a triangulation of the input graph. In this paper we study minimal tr...
Pinar Heggernes
DAC
2006
ACM
14 years 10 months ago
Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute i...
Sander Stuijk, Marc Geilen, Twan Basten
DATE
2003
IEEE
90views Hardware» more  DATE 2003»
14 years 3 months ago
Mapping Applications to an FPFA Tile
Abstract— This paper introduces a transformational design method which can be used to map code written in a high level source language, like C, to a coarse grain reconfigurable ...
Michèl A. J. Rosien, Yuanqing Guo, Gerard J...
PPSN
2004
Springer
14 years 3 months ago
An Improved Evaluation Function for the Bandwidth Minimization Problem
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our ...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
ICCV
2009
IEEE
13 years 7 months ago
Minimizing energy functions on 4-connected lattices using elimination
We describe an energy minimization algorithm for functions defined on 4-connected lattices, of the type usually encountered in problems involving images. Such functions are often ...
Peter Carr, Richard Hartley