3941 search results - page 583 / 789 » Computational Efficiency of Batching Methods |
ECCV
2008
Springer
14 years 8 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
BMCBI
2007
13 years 10 months ago
2007
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
FCCM
1999
IEEE
14 years 2 months ago
1999
IEEE
The time it takes to reconfigure FPGAs can be a significant overhead for reconfigurable computing. In this paper we develop new compression algorithms for FPGA configurations that...
BMCBI
2007
13 years 10 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
RECOMB
2006
Springer
14 years 10 months ago
2006
Springer
Meiotic recombination is a fundamental biological event and one of the principal evolutionary forces responsible for shaping genetic variation within species. In addition to its fu...