Sciweavers

1057 search results - page 52 / 212
» Theoretical and Experimental DNA Computation
Sort
View
TCS
2011
14 years 4 months ago
An algorithmic framework for network reconstruction
Models of biological systems and phenomena are of high scientific interest and practical relevance, but not always easy to obtain due to their inherent complexity. To gain the re...
Markus Durzinsky, Annegret Wagler, Robert Weismant...
ICCV
2007
IEEE
15 years 11 months ago
MRF Optimization via Dual Decomposition: Message-Passing Revisited
A new message-passing scheme for MRF optimization is proposed in this paper. This scheme inherits better theoretical properties than all other state-of-the-art message passing met...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas
CSR
2010
Springer
15 years 1 months ago
A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
Abstract. The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been ...
Gerold Jäger, Weixiong Zhang
MICS
2008
72views more  MICS 2008»
14 years 9 months ago
Dynamic Multi-level Overlay Graphs for Shortest Paths
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
RECOMB
2009
Springer
15 years 10 months ago
How Many Bootstrap Replicates Are Necessary?
Phylogenetic Bootstrapping (BS) is a standard technique for inferring confidence values on phylogenetic trees that is based on reconstructing many trees from minor variations of th...
Nicholas D. Pattengale, Masoud Alipour, Olaf R. P....