Sciweavers

1722 search results - page 128 / 345
» On the sample mean of graphs
Sort
View
JEC
2006
61views more  JEC 2006»
15 years 6 months ago
Time-constrained loop scheduling with minimal resources
Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
ENTCS
2007
93views more  ENTCS 2007»
15 years 6 months ago
Modeling Pointer Redirection as Cyclic Term-graph Rewriting
We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirectio...
Dominique Duval, Rachid Echahed, Fréd&eacut...
JCT
2007
111views more  JCT 2007»
15 years 6 months ago
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements
Hyperplanes of the form xj = xi + c are called affinographic. For an affinographic hyperplane arrangement in Rn, such as the Shi arrangement, we study the function f(m) that counts...
David Forge, Thomas Zaslavsky
WG
1998
Springer
15 years 10 months ago
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
Serafino Cicerone, Gabriele Di Stefano
WSC
2001
15 years 7 months ago
On the MSE robustness of batching estimators
Variance is a classical measure of a point estimator's sampling error. In steady-state simulation experiments, many estimators of this variance--or its square root, the stand...
Yingchieh Yeh, Bruce W. Schmeiser