Sciweavers

158 search results - page 10 / 32
» Some counting problems related to permutation groups
Sort
View
CEC
2010
IEEE
13 years 8 months ago
Beyond No Free Lunch: Realistic algorithms for arbitrary problem classes
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
James A. R. Marshall, Thomas G. Hinton
DM
2008
77views more  DM 2008»
13 years 6 months ago
Perfect Skolem sets
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
Gustav Nordh
MLDM
2007
Springer
14 years 1 months ago
Applying Frequent Sequence Mining to Identify Design Flaws in Enterprise Software Systems
In this paper we show how frequent sequence mining (FSM) can be applied to data produced by monitoring distributed enterprise applications. In particular we show how we applied FSM...
Trevor Parsons, John Murphy, Patrick O'Sullivan
CLEIEJ
2008
88views more  CLEIEJ 2008»
13 years 7 months ago
A Trust Model for a Group of E-mail Servers
E-mail services are essential in the Internet. However, the current e-mail architecture presents problems that open it to several threats. Alternatives have been proposed to solve...
Leonardo de Oliveira, Carlos Maziero
CRYPTO
2001
Springer
145views Cryptology» more  CRYPTO 2001»
14 years 2 days ago
Pseudorandomness from Braid Groups
Recently the braid groups were introduced as a new source for cryptography. The group operations are performed efficiently and the features are quite different from those of other...
Eonkyung Lee, Sangjin Lee, Sang Geun Hahn