255 search results - page 5 / 51 » Approximate Tree Embedding Problem - An Algebraic Approach |
TCS
2010
13 years 5 months ago
2010
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
FUZZIEEE
2007
IEEE
14 years 1 months ago
2007
IEEE
— DNA sequence basecalling is commonly regarded as a solved problem, despite significant error rates being reflected in inaccuracies in databases and genome annotations. This has...
SIAMDM
2008
13 years 7 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
AMDO
2004
Springer
14 years 26 days ago
2004
Springer
In this paper, a method for image deformation is presented. It is based upon decomposition of the deformation problem into basic physical laws. Unlike other methods that solve a di...
RECOMB
2006
Springer
14 years 7 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...