172 search results - page 10 / 35 » Improving the Time Complexity of Matsui's Linear Cryptanalys... |
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
135
click to vote
COMGEO
2012
ACM
13 years 7 months ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
101
Voted
CAD
2008
Springer
14 years 11 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
92
Voted
ISQED
2008
IEEE
15 years 6 months ago
2008
IEEE
Clock meshes have found increasingly wide applications in today’s high-performance IC designs. The inherent routing redundancies associated with clock meshes lead to improved cl...
IMA
1995
Springer
15 years 3 months ago
1995
Springer
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...