16666 search results - page 363 / 3334 » Descriptive and Computational Complexity |
191
click to vote
COMPGEOM
2005
ACM
15 years 8 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...
203
click to vote
CIE
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. In [She82], it is shown that four of its basic functional properties are enough to characterize plain Kolmogorov complexity, hence obtaining an axiomatic characterization...
253
click to vote
AAAI
2012
13 years 9 months ago
2012
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...
174
click to vote
CVPR
2008
IEEE
16 years 8 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...
204
click to vote
HAPTICS
2009
IEEE
16 years 1 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...