777 search results - page 19 / 156 » A fast algorithm for the computation of an upper bound on th... |
IPL
2011
12 years 11 months ago
2011
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
We propose an integral image based algorithm to extract feature covariance matrices of all possible rectangular regions within a given image. Covariance is an essential indicator ...
ENTCS
2008
13 years 7 months ago
2008
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
PODC
2003
ACM
14 years 22 days ago
2003
ACM
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
RT
1995
Springer
13 years 11 months ago
1995
Springer
We present a simple and inexpensive method for computing the estimates of error in a hierarchical linear radiosity method. Similar to the approach used in 1 for constant radiosity ...