933 search results - page 79 / 187 » Monotone Complexity of a Pair |
APAL
2010
13 years 9 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
FSE
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The slide attack is applicable to ciphers that can be represented as an iterative application of the same keyed permutation. The slide attack leverages simple attacks on ...
IEEEVAST
2010
13 years 3 months ago
2010
Co-located collaboration can be extremely valuable during complex visual analytics tasks. This paper presents an exploratory study of a system designed to support collaborative vi...
CVPR
2000
IEEE
14 years 11 months ago
2000
IEEE
This paper describes a new method for determining correspondence between points on pairs of surfaces based on shape using a combination of geodesic distance and surface curvature....
ISSAC
2005
Springer
14 years 2 months ago
2005
Springer
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...