Sciweavers

2314 search results - page 231 / 463
» Minimal Partitions of a Graph
Sort
View
AUSAI
2005
Springer
15 years 10 months ago
Conditioning Graphs: Practical Structures for Inference in Bayesian Networks
Abstract. Programmers employing inference in Bayesian networks typically rely on the inclusion of the model as well as an inference engine into their application. Sophisticated inf...
Kevin Grant, Michael C. Horsch
ICCAD
2000
IEEE
149views Hardware» more  ICCAD 2000»
15 years 8 months ago
Dynamic Response Time Optimization for SDF Graphs
Synchronous Data Flow (SDF) is a well-known model of computation that is widely used in the control engineering and digital signal processing domains. Existing scheduling methods ...
Dirk Ziegenbein, Jan Uerpmann, Ralph Ernst
ISCAS
1994
IEEE
104views Hardware» more  ISCAS 1994»
15 years 8 months ago
A Graph-Theoretic Approach to Clock Skew Optimization
This paper addresses the problem of minimizing the clock period of a circuit by optimizingthe clock skews. We incorporate uncertainty factors and present a formulation that ensure...
Rahul B. Deokar, Sachin S. Sapatnekar
ALGORITHMICA
2008
83views more  ALGORITHMICA 2008»
15 years 4 months ago
Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs
In this paper we consider the p-ary transitive reduction (TRp) problem where p > 0 is an integer; for p = 2 this problem arises in inferring a sparsest possible (biological) sig...
Réka Albert, Bhaskar DasGupta, Riccardo Don...
CVPR
2008
IEEE
16 years 6 months ago
Non-negative graph embedding
We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graph...
Jianchao Yang, Shuicheng Yan, Yun Fu, Xuelong Li, ...