Sciweavers

388 search results - page 48 / 78
» Quantum Lower Bounds by Polynomials
Sort
View
ICDM
2005
IEEE
177views Data Mining» more  ICDM 2005»
14 years 3 months ago
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
Loïck Lhote, François Rioult, Arnaud S...
WINE
2007
Springer
128views Economy» more  WINE 2007»
14 years 4 months ago
Total Latency in Singleton Congestion Games
Abstract. In this work, we consider singleton congestion games as a special class of (weighted) congestion games where each players' strategy consists only of a single resourc...
Martin Gairing, Florian Schoppmann
CEC
2005
IEEE
14 years 3 months ago
On the complexity of overcoming gaps with isotropic mutations and elitist selection
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
Jens Jägersküpper
WCC
2005
Springer
117views Cryptology» more  WCC 2005»
14 years 3 months ago
Interpolation of Functions Related to the Integer Factoring Problem
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
Clemens Adelmann, Arne Winterhof
EOR
2008
91views more  EOR 2008»
13 years 10 months ago
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
Giovanni Righini