Sciweavers

126 search results - page 15 / 26
» Validation Sequence Optimization: A Theoretical Approach
Sort
View
IMSCCS
2006
IEEE
14 years 1 months ago
Combining Comparative Genomics with de novo Motif Discovery to Identify Human Transcription Factor DNA-Binding Motifs
Background: As more and more genomes are sequenced, comparative genomics approaches provide a methodology for identifying conserved regulatory elements that may be involved in gen...
Linyong Mao, W. Jim Zheng
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
14 years 25 days ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
COR
2008
122views more  COR 2008»
13 years 7 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
ECCV
2006
Springer
13 years 11 months ago
Trace Quotient Problems Revisited
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...
Shuicheng Yan, Xiaoou Tang
CVPR
2009
IEEE
1081views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Learning Real-Time MRF Inference for Image Denoising
Many computer vision problems can be formulated in a Bayesian framework with Markov Random Field (MRF) or Conditional Random Field (CRF) priors. Usually, the model assumes that ...
Adrian Barbu (Florida State University)