778 search results - page 95 / 156 » Bounding Smooth Integers |
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we study on-line windows scheduling (WS) of temporary items. In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit...
ISSAC
2004
Springer
14 years 1 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
ISMVL
2010
IEEE
14 years 24 days ago
2010
IEEE
Abstract—Let A and B be integers such that A ≤ B. An nvariable interval function is a mapping IN[n : A, B] : {0, 1}n → {0, 1}, where IN[n : A, B](X) = 1 iff A ≤ X ≤ B. Su...
CSR
2010
Springer
14 years 15 days ago
2010
Springer
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
IWANN
2001
Springer
14 years 4 days ago
2001
Springer
This paper proposes the general paradigm to build Q'tron neural networks (NNs) for visual cryptography. Given a visual encryption scheme, usually described using an access st...