5 search results - page 1 / 1 » Nested Graph Dissection and Approximation Algorithms |
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
SIAMSC
2010
12 years 11 months ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
PG
2000
IEEE
13 years 9 months ago
2000
IEEE
This paper presents solutions to the feature correspondence and feature interpolation problems in image morphing. The user specifies the correspondence between the source and the...
GECCO
2008
Springer
13 years 5 months ago
2008
Springer
A well-designed fitness function is essential to the effectiveness and efficiency of evolutionary testing. Fitness function design has been researched extensively. For fitness ...