Sciweavers

4581 search results - page 573 / 917
» Computing Transformation Semigroups
Sort
View
123
Voted
CN
1999
88views more  CN 1999»
15 years 6 months ago
Formsheets and the XML Forms Language
This paper presents XForm -- a proposal for a general and powerful mechanism for handling forms in XML. XForm defines form -- related constructs independent of any particular XML ...
Anders Kristensen
165
Voted
JCB
2002
102views more  JCB 2002»
15 years 6 months ago
A Lower Bound on the Reversal and Transposition Diameter
One possible model to study genome evolution is to represent genomes as permutations of genes and compute distances based on the minimum number of certain operations (rearrangemen...
João Meidanis, Maria Emilia Telles Walter, ...
INFSOF
1998
73views more  INFSOF 1998»
15 years 6 months ago
Restructuring programs by tucking statements into functions
Changing the internal structure of a program without changing its behavior is called restructuring. This paper presents a transformation called tuck for restructuring programs by ...
Arun Lakhotia, Jean-Christophe Deprez
JCSS
2002
95views more  JCSS 2002»
15 years 6 months ago
Efficient algorithms for multichromosomal genome rearrangements
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
Glenn Tesler
TIP
1998
137views more  TIP 1998»
15 years 6 months ago
Blocking effect reduction of JPEG images by signal adaptive filtering
Abstract—A postprocessing algorithm is proposed to reduce the blocking artifacts of Joint Photographic Experts Group (JPEG) decompressed images. The reconstructed images from JPE...
Y. L. Lee, H. C. Kim, H. W. Park