748 search results - page 49 / 150 » Time and Probability in Process Algebra |
95
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
119
click to vote
ICIAR
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. In this paper we propose a method for automating the process of detecting regions of motion in a video sequence in real time. The main idea of this work is to detect moti...
DAC
2002
ACM
16 years 1 months ago
2002
ACM
CT The traditional approach to worst-case static-timing analysis is becoming unacceptably conservative due to an ever-increasing number of circuit and process effects. We propose a...
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
Cooperative communications is a rapidly evolving research area. Most of the cooperative protocols that have appeared in the literature assume slow flat fading channels and Gaussi...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract — We consider a space-time coded system in a correlated Rayleigh flat fading environment. The channel state information (CSI) is obtained from the known pilot code matr...