13603 search results - page 212 / 2721 » On the Complexity of Computing Treelength |
155
click to vote
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
137
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
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...
158
click to vote
HAPTICS
2009
IEEE
15 years 11 months ago
2009
IEEE
The force-update-rate requirements of transparent rendering of virtual environments are in conflict with the computational cost required for computing complex interactions betwee...
134
Voted
IWPEC
2009
Springer
15 years 11 months ago
2009
Springer
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...
141
click to vote
ICMCS
2005
IEEE
15 years 10 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...