1153 search results - page 36 / 231 » Reversing graph transformations |
IVC
2002
13 years 7 months ago
2002
Object decomposition into simpler parts greatly diminishes the complexity of a recognition task. In this paper, we present a method to decompose a 3D discrete object into nearly c...
SCAM
2009
IEEE
14 years 2 months ago
2009
IEEE
—As multicore and heterogeneous multiprocessor platforms replace uniprocessor systems, software programs must be designed with a greater emphasis on concurrency. Threading has be...
CPM
2001
Springer
14 years 3 days 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...
GC
2008
Springer
13 years 7 months ago
2008
Springer
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...
DM
2000
13 years 7 months ago
2000
Word reversing is a combinatorial operation on words that detects pairs of equivalent words in monoids that admit a presentation of a certain form. Here we give conditions for this...