Sciweavers

441 search results - page 13 / 89
» Optimal Subsequence Bijection
Sort
View
ISMB
1994
14 years 11 months ago
Optimally Parsing a Sequence into Different Classes Based on Multiple Types of Evidence
Weconsider the problem of parsing a sequence into different classes of subsequences.Twocommonexamplesare finding the exons and introns in genomicsequences and identifying the seco...
Gary D. Stormo, David Haussler
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 3 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
CEC
2009
IEEE
15 years 27 days ago
Direct and explicit building blocks identification and composition algorithm
— This paper proposes a new algorithm to identify and compose building blocks based on minimum mutual information criterion. Building blocks are interpreted as common subsequence...
Chalermsub Sangkavichitr, Prabhas Chongstitvatana
77
Voted
NIPS
1990
14 years 10 months ago
Planning with an Adaptive World Model
We present a new connectionist planning method TML90 . By interaction with an unknown environment, a world model is progressively constructed using gradient descent. For deriving ...
Sebastian Thrun, Knut Möller, Alexander Linde...
FPGA
2007
ACM
185views FPGA» more  FPGA 2007»
15 years 3 months ago
Power-aware FPGA logic synthesis using binary decision diagrams
Power consumption in field programmable gate arrays (FPGAs) has become an important issue as the FPGA market has grown to include mobile platforms. In this work we present a power...
Kevin Oo Tinmaung, David Howland, Russell Tessier