Sciweavers

240 search results - page 37 / 48
» Comparing Sequences with Segment Rearrangements
Sort
View
GECCO
2000
Springer
112views Optimization» more  GECCO 2000»
13 years 11 months ago
Code Compaction Using Genetic Algorithms
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
Keith E. Mathias, Larry J. Eshelman, J. David Scha...
BILDMED
2008
122views Algorithms» more  BILDMED 2008»
13 years 9 months ago
A Comparison of Five Methods for Signal Intensity Standardization in MRI
A major problem in magnetic resonance imaging (MRI) is the lack of a pulse sequence dependent standardized intensity scale like the Hounsfield units in computed tomography. This af...
Jan-Philip Bergeest, Florian Jäger
BMVC
1998
13 years 9 months ago
Learning Enhanced 3D Models for Vehicle Tracking
This paper presents an enhanced hypothesis verification strategy for 3D object recognition. A new learning methodology is presented which integrates the traditional dichotomic obj...
James M. Ferryman, Anthony D. Worrall, Stephen J. ...
BMCBI
2008
134views more  BMCBI 2008»
13 years 7 months ago
PEPOP: Computational design of immunogenic peptides
Background: Most methods available to predict protein epitopes are sequence based. There is a need for methods using 3D information for prediction of discontinuous epitopes and de...
Violaine Moreau, Cécile Fleury, Dominique P...
CSDA
2006
85views more  CSDA 2006»
13 years 7 months ago
Detecting change-points in multidimensional stochastic processes
A general test statistic for detecting change-points in multidimensional stochastic processes with unknown parameters is proposed. The test statistic is specialized to the case of...
Jan G. De Gooijer