Sciweavers

1722 search results - page 35 / 345
» On the sample mean of graphs
Sort
View
PE
2007
Springer
104views Optimization» more  PE 2007»
15 years 5 months ago
Flow vs. time sampling for throughput performance evaluation
We introduce two throughput metrics referred to as flow- and time-sampled throughputs. The former gives the throughput statistics of an arbitrary flow while the latter weights t...
T. Bonald, M.-A. Tran
ECCV
2008
Springer
16 years 8 months ago
Non-local Regularization of Inverse Problems
This article proposes a new framework to regularize linear inverse problems using the total variation on non-local graphs. This nonlocal graph allows to adapt the penalization to t...
Gabriel Peyré, Laurent D. Cohen, Séb...
JAIR
2007
112views more  JAIR 2007»
15 years 6 months ago
Cutset Sampling for Bayesian Networks
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network s...
Bozhena Bidyuk, Rina Dechter
GLVLSI
1997
IEEE
98views VLSI» more  GLVLSI 1997»
15 years 10 months ago
Scheduling with Confidence for Probabilistic Data-flow Graphs
Sissades Tongsima, Chantana Chantrapornchai, Edwin...
ISCAPDCS
2001
15 years 7 months ago
On Retiming Synchronous Data-Flow Graphs
Timothy W. O'Neil, Edwin Hsing-Mean Sha