1632 search results - page 40 / 327 » On special numberings of hypergraphs |
150
click to vote
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
Let β be a real number with 1 < β < 2. We prove that the language of the β-shift is ∆0 n iff β is a ∆n-real. The special case where n is 1 is the independently inter...
142
click to vote
CRYPTO
1992
Springer
15 years 10 months ago
1992
Springer
Using a number field sieve, discrete logarithms modulo primes of special forms can be found faster than standard primes. This has raised concerns about trapdoors in discrete log cr...
140
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this article we present a method for formally proving the correctness of the lazy algorithms for computing homographic and quadratic transformations -- of which field operations...
164
click to vote
EJC
2010
15 years 6 months ago
2010
Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we ...
161
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involv...