Sciweavers

160 search results - page 5 / 32
» Equivalence between Schedule Representations: Theory and App...
Sort
View
FUIN
2008
108views more  FUIN 2008»
13 years 6 months ago
Learning Ground CP-Logic Theories by Leveraging Bayesian Network Learning Techniques
Causal relations are present in many application domains. Causal Probabilistic Logic (CP-logic) is a probabilistic modeling language that is especially designed to express such rel...
Wannes Meert, Jan Struyf, Hendrik Blockeel
EMSOFT
2008
Springer
13 years 9 months ago
A generalized static data flow clustering algorithm for mpsoc scheduling of multimedia applications
In this paper, we propose a generalized clustering approach for static data flow subgraphs mapped onto individual processors in Multi-Processor System on Chips (MPSoCs). The goal ...
Joachim Falk, Joachim Keinert, Christian Haubelt, ...
ICCD
2006
IEEE
113views Hardware» more  ICCD 2006»
14 years 4 months ago
A theory of Error-Rate Testing
— We have entered an era where chip yields are decreasing with scaling. A new concept called intelligible testing has been previously proposed with the goal of reversing this tre...
Shideh Shahidi, Sandeep Gupta
WADS
2009
Springer
281views Algorithms» more  WADS 2009»
14 years 2 months ago
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
Krishnam Raju Jampani, Anna Lubiw
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
14 years 18 days ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha