4781 search results - page 572 / 957 » Complexity at large |
158
click to vote
ECCC
2010
15 years 6 months ago
2010
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...
158
click to vote
IJCV
2006
15 years 6 months ago
2006
In this paper, we suggest a variational model for optic flow computation based on non-linearised and higher order constancy assumptions. Besides the common grey value constancy ass...
177
click to vote
CGF
1998
15 years 6 months ago
1998
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...
175
click to vote
SIGSOFT
2010
ACM
15 years 4 months ago
2010
ACM
Concurrent program verification is challenging because it involves exploring a large number of possible thread interleavings together with complex sequential reasoning. As a resul...
220
click to vote
TCSV
2010
15 years 1 months ago
2010
We propose a novel successive convex matching method for human action detection in cluttered video. Human actions are represented as sequences of poses, and specific actions are de...