Sciweavers

359 search results - page 21 / 72
» Multi-state Directed Acyclic Graphs
Sort
View
PAAPP
2000
118views more  PAAPP 2000»
14 years 11 months ago
Processor-time-optimal systolic arrays
Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic gra...
Peter R. Cappello, Ömer Egecioglu, Chris J. S...
PR
2007
134views more  PR 2007»
14 years 11 months ago
An elastic partial shape matching technique
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
DAM
2010
104views more  DAM 2010»
14 years 10 months ago
Sorting with networks of data structures
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
Therese C. Biedl, Alexander Golynski, Angèl...
WADS
2009
Springer
232views Algorithms» more  WADS 2009»
15 years 6 months ago
On Making Directed Graphs Transitive
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
Mathias Weller, Christian Komusiewicz, Rolf Nieder...
SMI
2006
IEEE
121views Image Analysis» more  SMI 2006»
15 years 5 months ago
Minimum Ratio Contours on Surface Meshes
We present a novel approach for discretely optimizing contours on the surface of a triangle mesh. This is achieved through the use of a minimum ratio cycle (MRC) algorithm, where ...
Andrew Clements, Hao Zhang 0002