2392 search results - page 444 / 479 » Matching data dissemination algorithms to application requir... |
DATE
2002
IEEE
15 years 4 months ago
2002
IEEE
We have developed a technique to compute a Quasi Static Schedule of a concurrent specification for the software partition of an embedded system. Previous work did not take into a...
EUROCRYPT
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
SIGGRAPH
2000
ACM
15 years 4 months ago
2000
ACM
Visibility determination is a key requirement in a wide range of graphics algorithms. This paper introduces a new approach to the computation of volume visibility, the detection o...
123
click to vote
HPCA
1998
IEEE
15 years 4 months ago
1998
IEEE
Run-time parallelization is often the only way to execute the code in parallel when data dependence information is incomplete at compile time. This situation is common in many imp...
119
click to vote
EURONGI
2008
Springer
15 years 1 months ago
2008
Springer
The guaranteed delivery of critical data is an essential requirement in most Wireless Sensor Network (WSN) applications. The paucity of energy, communication, processing and storag...