Sciweavers

2089 search results - page 59 / 418
» A New Problem in String Searching
Sort
View
CEC
2010
IEEE
14 years 11 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
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
15 years 10 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
JODL
2000
201views more  JODL 2000»
14 years 9 months ago
A transaction log analysis of a digital library
As experimental digital library testbeds gain wider acceptance and develop significant user bases, it becomes important to investigate the ways in which users interact with the sy...
Steve Jones, Sally Jo Cunningham, Rodger J. McNab,...
ICARIS
2004
Springer
15 years 3 months ago
Online Negative Databases
The benefits of negative detection for obscuring information are explored in the context of Artificial Immune Systems (AIS). AIS based on string matching have the potential for a...
Fernando Esponda, Elena S. Ackley, Stephanie Forre...
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
15 years 3 months ago
ATNoSFERES revisited
ATNoSFERES is a Pittsburgh style Learning Classifier System (LCS) in which the rules are represented as edges of an Augmented Transition Network. Genotypes are strings of tokens ...
Samuel Landau, Olivier Sigaud, Marc Schoenauer