172 search results - page 27 / 35 » Improving the Time Complexity of Matsui's Linear Cryptanalys... |
105
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
Using Boolean AND and OR functions to combine the responses of multiple one- or two-class classifiers in the ROC space may significantly improve performance of a detection system o...
120
click to vote
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
114
click to vote
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. Movies and TV are a rich source of diverse and complex video of people, objects, actions and locales "in the wild". Harvesting automatically labeled sequences o...
ICCAD
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we study the problem of retiming of sequential circuits with both interconnect and gate delay. Most retiming algorithms have assumed ideal conditions for the non-lo...
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...