Sciweavers

140 search results - page 18 / 28
» String Quartets In Binary
Sort
View
SPIRE
2009
Springer
14 years 2 months ago
Generalised Matching
Given a pattern p over an alphabet Σp and a text t over an alphabet Σt, we consider the problem of determining a mapping f from Σp to Σ+ t such that t = f(p1)f(p2) . . . f(pm)....
Raphaël Clifford, Aram Wettroth Harrow, Alexa...
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 1 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom
ICANN
2009
Springer
14 years 5 days ago
Computing with Probabilistic Cellular Automata
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
Martin Schüle, Thomas Ott, Ruedi Stoop
DASFAA
2007
IEEE
148views Database» more  DASFAA 2007»
13 years 11 months ago
An Efficient Encoding and Labeling for Dynamic XML Data
In order to efficiently determine structural relationships among XML elements and to avoid re-labeling for updates, much research about labeling schemes has been conducted, recentl...
Jun-Ki Min, Jihyun Lee, Chin-Wan Chung
ACSAC
2004
IEEE
13 years 11 months ago
Detecting Attacks That Exploit Application-Logic Errors Through Application-Level Auditing
Host security is achieved by securing both the operating system kernel and the privileged applications that run on top of it. Application-level bugs are more frequent than kernel-...
Jingyu Zhou, Giovanni Vigna