Sciweavers

87 search results - page 10 / 18
» Denotation by Transformation
Sort
View
EJC
2010
13 years 7 months ago
On the distance between the expressions of a permutation
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...
Patrick Dehornoy, Marc Autord
COMPGEOM
2009
ACM
13 years 5 months ago
Geometric tomography: a limited-view approach for computed tomography
Computed tomography(CT), especially since the introduction of helical CT, provides excellent visualization of the internal organs of the body. As a result, CT is used routinely in...
Peter B. Noël, Jinhui Xu, Kenneth R. Hoffmann...
AAIM
2009
Springer
118views Algorithms» more  AAIM 2009»
14 years 2 months ago
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier...
POPL
2008
ACM
14 years 8 months ago
Boomerang: resourceful lenses for string data
A lens is a bidirectional program. When read from left to right, it denotes an ordinary function that maps inputs to outputs. When read from right to left, it denotes an "upd...
Aaron Bohannon, J. Nathan Foster, Benjamin C. Pier...
EUROPAR
2003
Springer
14 years 24 days ago
Parallel ScaLAPACK-Style Algorithms for Solving Continuous-Time Sylvester Matrix Equations
An implementation of a parallel ScaLAPACK-style solver for the general Sylvester equation, op(A)X −Xop(B) = C, where op(A) denotes A or its transpose AT , is presented. The paral...
Robert Granat, Bo Kågström, Peter Porom...