Sciweavers

19320 search results - page 329 / 3864
» On the complexity of computing determinants
Sort
View
AAAI
2012
13 years 9 months ago
The Complexity of Planning Revisited - A Parameterized Analysis
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
Christer Bäckström, Yue Chen, Peter Jons...
CVPR
2008
IEEE
16 years 8 months ago
Modeling and generating complex motion blur for real-time tracking
This article addresses the problem of real-time visual tracking in presence of complex motion blur. Previous authors have observed that efficient tracking can be obtained by match...
Christopher Mei, Ian Reid
HAPTICS
2009
IEEE
16 years 1 months ago
Haptic rendering of complex deformations through handle-space force linearization
The force-update-rate requirements of transparent rendering of virtual environments are in conflict with the computational cost required for computing complex interactions betwee...
Carlos Garre, Miguel A. Otaduy
IWPEC
2009
Springer
16 years 1 months ago
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
Petr A. Golovach, Dimitrios M. Thilikos
ICMCS
2005
IEEE
98views Multimedia» more  ICMCS 2005»
16 years 10 days ago
Hybrid Algorithm with Adaptive Complexity for Integer Pel Motion Estimation of H.264
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...
Li Zhang, Wen Gao