2905 search results - page 437 / 581 » Formal Memetic Algorithms |
141
Voted
RECOMB
2003
Springer
16 years 3 months ago
2003
Springer
The availability of whole genome sequences and high-throughput genomic assays opens the door for in silico analysis of transcription regulation. This includes methods for discover...
120
click to vote
CADE
2008
Springer
16 years 3 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
214
Voted
VLDB
2003
ACM
16 years 3 months ago
2003
ACM
Data warehousing systems integrate information from operational data sources into a central repository to enable analysis and mining of the integrated information. During the integ...
206
click to vote
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...
225
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Whether beloved or despised, XML Schema is momentarily the only industrially accepted schema language for XML and is unlikely to become obsolete any time soon. Nevertheless, many ...