نتایج جستجو برای: sieve
تعداد نتایج: 4647 فیلتر نتایج به سال:
Carbon molecular sieve membranes (CMSMs) are an important alternative for gas separation because of their ease of manufacture, high selectivity due to molecular sieve separation, and high permeance. The integration of separation by membranes and reaction in only one unit lead to a high degree of process integration/intensification, with associated benefits of increased energy, production effici...
The best practical algorithm for class group computations in imaginary quadratic number fields (such as group structure, class number, discrete logarithm computations) is a variant of the quadratic sieve factoring algorithm. Paradoxical as it sounds, the principles of the number field sieve, in a strict sense, could not be applied to number field computations, yet. In this article we give an in...
The number field sieve is a relatively new method to factor large integers. Its most notable success is the factorization of the ninth Fermat number. It is significantly faster than all known existing integer factoring algorithms. We examine the theoretical underpinnings of the sieve; after understanding how it works, we state the algorithm. We look mostly to the algebraic number theory aspects...
Major cloud computing operators provide powerful monitoring tools to understand the current (and prior) state of the distributed systems deployed in their infrastructure. While such tools provide a detailed monitoring mechanism at scale, they also pose a significant challenge for the application developers/operators to transform the huge space of monitored metrics into useful insights. These in...
The popular method of enumerating the primes is the Sieve of Eratosthenes. It can be programmed very neatly in a lazy functional language, but runs rather slowly. A little-known alternative method is the Wheel Sieve, originally formulated as a fast imperative algorithm for obtaining all primes up to a given limit, assuming destructive access to a bit-array. This article describes functional var...
In AsiaCCS 2011, Wang et al. proposed a two-level heuristic sieve algorithm for the shortest vector problem in lattices, which improves the Nguyen-Vidick sieve algorithm. Inspired by their idea, we present a three-level sieve algorithm in this paper, which is shown to have better time complexity. More precisely, the time complexity of our algorithm is 2 polynomial-time operations and the corres...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید