2455 search results - page 66 / 491 » Computability of Models for Sequence Assembly |
DNA
2006
Springer
14 years 12 days ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
ICIP
2007
IEEE
14 years 10 months ago
2007
IEEE
In this paper, we propose a novel technique for estimating focused image sequences captured by an out-of-focus camera. The basic concept used in the proposed algorithm employs mul...
CIE
2005
Springer
14 years 2 months ago
2005
Springer
We promote the concept of object directed computability in computational geometry in order to faithfully generalise the wellestablished theory of computability for real numbers and...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
In this paper, we propose a novel dense depth recovery method for a trinocular video sequence. Specifically, we contribute a novel trinocular stereo matching model, which can eff...
DATE
2002
IEEE
14 years 1 months ago
2002
IEEE
By using a macro/micro state model we show how assumptions on the resolution of logical and physical timing of computation in computer systems has resulted in design methodologies...