6943 search results - page 1133 / 1389 » Representations for evolutionary algorithms |
191
click to vote
BIOID
2008
15 years 8 months ago
2008
The determination of hashes based on biometric data is a recent topic in biometrics as it allows to handle biometric templates in a privacy manner. Applications could be the genera...
168
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
200
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
The Web contains a large amount of documents and increasingly, also semantic data in the form of RDF triples. Many of these triples are annotations that are associated with docume...
163
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
175
click to vote
ECOOP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...