140 search results - page 22 / 28 » Computing the Edit-Distance between Unrooted Ordered Trees |
STOC
2007
ACM
14 years 9 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
The segmentation and analysis of blood vessels has received much attention in the research community. The results aid numerous applications for diagnosis and treatment of vascular...
CAV
2010
Springer
14 years 13 days ago
2010
Springer
Abstract. We present the tool MERIT, a CEGAR model-checker for safety propf counter-systems, which sits in the Lazy Abstraction with Interpolants (LAWI) framework. LAWI is parametr...
RECOMB
2004
Springer
14 years 9 months ago
2004
Springer
We have developed a multiple genome alignment algorithm by using a sequence clustering algorithm to combine local pairwise genome sequence matches produced by pairwise genome align...