104 search results - page 5 / 21 » Dependency trees in sub-linear time and bounded memory |
MST
2011
13 years 3 months ago
2011
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
ISOLA
2010
Springer
13 years 7 months ago
2010
Springer
In object oriented languages, dynamic memory allocation is a fundamental concept. When using such a language in hard real-time systems, it becomes important to bound both the worst...
OTM
2004
Springer
14 years 2 months ago
2004
Springer
Cache memories are mandatory to bridge the growing gap between CPU speed and main memory access time. Standard cache organizations improve the average execution time but are diffi...
DMTCS
2010
13 years 6 months ago
2010
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
IPPS
1997
IEEE
14 years 29 days ago
1997
IEEE
This paper presents a compile-time scheme for partitioning non-rectangular loop nests which consist of inner loops whose bounds depend on the index of the outermost, parallel loop...