1274 search results - page 45 / 255 » Graph lambda theories |
SCIA
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Variational frameworks based on level set methods are popular for the general problem of image segmentation. They combine different feature channels in an energy minimiz...
PLILP
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
ACL
1993
13 years 10 months ago
1993
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
CPM
2001
Springer
14 years 1 months ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
FSTTCS
2007
Springer
14 years 3 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...