10988 search results - page 391 / 2198 » Algorithmic Folding Complexity |
129
click to vote
ICFEM
2009
Springer
15 years 2 months ago
2009
Springer
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
188
click to vote
SIAMCOMP
2010
14 years 11 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
125
click to vote
ICIP
1998
IEEE
16 years 6 months ago
1998
IEEE
Motion estimation represents the most computationally intensive task for all efficient motion compensated compression standards. This fact, despite the several eflorts aiming at r...
168
click to vote
Publication
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
139
click to vote
ISM
2008
IEEE
15 years 11 months ago
2008
IEEE
Reducing spatial redundancies between different camera views is one of the major challenges in multiview video coding (MVC). However, with drastic increase in time consumption of ...