Sciweavers

317 search results - page 38 / 64
» Computing and Updating the Process Number in Trees
Sort
View
BMCBI
2006
111views more  BMCBI 2006»
13 years 9 months ago
High throughput profile-profile based fold recognition for the entire human proteome
Background: In order to maintain the most comprehensive structural annotation databases we must carry out regular updates for each proteome using the latest profile-profile fold r...
Liam J. McGuffin, Richard T. Smith, Kevin Bryson, ...
RECOMB
2005
Springer
14 years 9 months ago
Stability of Rearrangement Measures in the Comparison of Genome Sequences
We present data-analytic and statistical tools for studying rates of rearrangement of whole genomes and to assess the stability of these methods with changes in the level of resol...
David Sankoff, Matthew Mazowita
CISS
2008
IEEE
14 years 3 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman
GBRPR
2007
Springer
14 years 3 months ago
Approximating TSP Solution by MST Based Graph Pyramid
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
Yll Haxhimusa, Walter G. Kropatsch, Zygmunt Pizlo,...
ICPR
2000
IEEE
14 years 1 months ago
3-D Object Reconstruction Using Spatially Extended Voxels and Multi-Hypothesis Voxel Coloring
In this paper we describe a voxel-based 3-D reconstruction technique from multiple calibrated camera views that makes explicit use of the finite size footprint of a voxel when pr...
Eckehard G. Steinbach, Bernd Girod, Peter Eisert, ...