Sciweavers

8 search results - page 2 / 2
» On Cost-Optimal Merge of Two Intransitive Sorted Sequences
Sort
View
SIGGRAPH
1998
ACM
13 years 9 months ago
Visibility Sorting and Compositing Without Splitting for Image Layer Decompositions
We present an efficient algorithm for visibility sorting a set of moving geometric objects into a sequence of image layers which are composited to produce the final image. Inste...
John M. Snyder, Jed Lengyel
ENTCS
2006
139views more  ENTCS 2006»
13 years 4 months ago
Improving the Usability of a Graph Transformation Language
Model transformation tools implemented using graph transformation techniques are often expected to provide high performance. For this reason, in the Graph Rewriting and Transforma...
Attila Vizhanyo, Sandeep Neema, Feng Shi, Daniel B...
BMCBI
2006
192views more  BMCBI 2006»
13 years 4 months ago
Analysis of circular genome rearrangement by fusions, fissions and block-interchanges
Background: Analysis of genomes evolving via block-interchange events leads to a combinatorial problem of sorting by block-interchanges, which has been studied recently to evaluat...
Chin Lung Lu, Yen-Lin Huang, Tsui Ching Wang, Hsie...