Sciweavers

6833 search results - page 111 / 1367
» Some two-character sets
Sort
View
ECCC
2011
187views ECommerce» more  ECCC 2011»
14 years 7 months ago
In Brute-Force Search of Correlation Bounds for Polynomials
We report on some initial results of a brute-force search for determining the maximum correlation between degree-d polynomials modulo p and the n-bit mod q function. For various s...
Frederic Green, Daniel Kreymer, Emanuele Viola
ADG
1998
Springer
127views Mathematics» more  ADG 1998»
15 years 8 months ago
Decomposing Algebraic Varieties
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...
Dongming Wang
EVOW
2009
Springer
15 years 1 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
ICDIM
2010
IEEE
15 years 1 months ago
Detecting incompleteness in access control policies using data classification schemes
In a set of access control policies, incompleteness is the existence of situations for which no policy applies. Some of these situations can be exploited by attackers, to obtain un...
Riaz Ahmed Shaikh, Kamel Adi, Luigi Logrippo, Serg...
SEKE
2010
Springer
15 years 1 months ago
Towards an Automation of Software Evolution Good Practices
It is well known that software evolution is an inescapable activity in the software lifecycle. In order to prevent the negative effects of this activity (decreased quality, increa...
Chouki Tibermacine, Soraya Sakhraoui, Vincent Le G...