2626 search results - page 74 / 526 » The complexity of stochastic sequences |
ICMCS
2005
IEEE
15 years 5 months ago
2005
IEEE
Owing to the great computation complexity of the ME (motion estimation) in video coding, a lot of fast ME algorithms have been proposed in literature. Most of them are designed ba...
119
click to vote
ICPR
2004
IEEE
16 years 29 days ago
2004
IEEE
The problem of automatic recognition of human activities is among the most important and challenging open areas of research in Computer Vision. This paper presents a new approach ...
103
click to vote
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
SARA
2007
Springer
15 years 6 months ago
2007
Springer
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
AIPS
2003
15 years 1 months ago
2003
We propose a framework for policy generation in continuoustime stochastic domains with concurrent actions and events of uncertain duration. We make no assumptions regarding the co...