2957 search results - page 221 / 592 » The Complexity of Polynomial-Time Approximation |
149
click to vote
CVPR
2007
IEEE
2007
IEEE
Leveraging temporal, contextual and ordering constraints for recognizing complex activities in video
16 years 8 months ago
We present a scalable approach to recognizing and describing complex activities in video sequences. We are interested in long-term, sequential activities that may have several par...
192
click to vote
ISAAC
2007
Springer
16 years 22 days ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
199
click to vote
GRAPHICSINTERFACE
2003
15 years 8 months ago
2003
Modeling complex realistic objects is a difficult and time consuming process. Nevertheless, with improvements in rendering speed and quality, more and more applications require s...
148
click to vote
PR
2007
15 years 6 months ago
2007
In this paper, we propose a novel image denoising method by incorporating the dual-tree complex wavelets into the ordinary ridgelet transform. The approximate shift invariant prop...
166
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
Transform approximations are explored for speeding up the software compression of images and video. Faster approximations are used to replace the regular DCT whenever only few DCT...