255 search results - page 5 / 51 » Approximate Tree Embedding Problem - An Algebraic Approach |
110
click to vote
TCS
2010
14 years 10 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...
98
Voted
FUZZIEEE
2007
IEEE
15 years 6 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...
90
Voted
SIAMDM
2008
15 years 8 days 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
15 years 5 months 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...
100
Voted
RECOMB
2006
Springer
16 years 20 days 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...