Sciweavers

1153 search results - page 113 / 231
» Reversing graph transformations
Sort
View
100
Voted
MSR
2006
ACM
15 years 6 months ago
Are refactorings less error-prone than other changes?
Refactorings are program transformations which should preserve the program behavior. Consequently, we expect that during phases when there are mostly refactorings in the change hi...
Peter Weißgerber, Stephan Diehl
105
Voted
ICIAR
2005
Springer
15 years 6 months ago
A Steganographic Method for Digital Images Robust to RS Steganalysis
Digital images are increasingly being used as steganographic covers for secret communication. The Least Significant Bit (LSB) encoding is one of the most widely used methods for e...
André R. S. Marçal, Patricia R. Pere...
ICNC
2005
Springer
15 years 6 months ago
Using SOFM to Improve Web Site Text Content
We introduce a new method to improve web site text content by identifying the most relevant free text in the web pages. In order to understand the variations in web page text, we c...
Sebastián A. Ríos, Juan D. Vel&aacut...
100
Voted
SCAM
2003
IEEE
15 years 6 months ago
Parse-Tree Annotations Meet Re-Engineering Concerns
We characterise a computational model for processing annotated parse trees. The model is basically rewriting-based with specific provisions for dealing with annotations along the...
Jan Kort, Ralf Lämmel
DAC
1995
ACM
15 years 4 months ago
Automatic Clock Abstraction from Sequential Circuits
Our goal is to transform a low-level circuit design into a more representation. A pre-existing tool, Tranalyze [4], takes a switch-level circuit and generates a functionally equiv...
Samir Jain, Randal E. Bryant, Alok Jain