1153 search results - page 36 / 231 » Reversing graph transformations |
115
Voted
IVC
2002
15 years 14 days 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...
104
Voted
SCAM
2009
IEEE
15 years 7 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...
96
Voted
CPM
2001
Springer
15 years 5 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...
101
click to vote
GC
2008
Springer
15 years 25 days 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...
111
Voted
DM
2000
15 years 18 days 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...