498 search results - page 5 / 100 » A Theory of Complexity for Continuous Time Systems |
CHARME
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. I develop a compositional theory of refinement for the branching time framework based on stuttering simulation and prove that if one system refines another, then a refine...
ISCC
2008
IEEE
14 years 1 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
Analysis and design of ltered-x adaptive algorithms are conventionally done by assuming that the transfer function in the secondary path is a discrete-time system. However, in rea...
PKDD
2001
Springer
13 years 11 months ago
2001
Springer
This paper discusses the clustering quality and complexities of the hierarchical data clustering algorithm based on gravity theory. The gravitybased clustering algorithm simulates ...
STOC
1989
ACM
13 years 11 months ago
1989
ACM
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...