1153 search results - page 20 / 231 » Reversing graph transformations |
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hie...
INFSOF
2007
13 years 7 months ago
2007
An infrastructure is a set of interconnected structural elements, such as tools and schemas, that provide a framework for supporting an entire structure. The reverse engineering c...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
ICSE
1995
IEEE-ACM
13 years 11 months ago
1995
IEEE-ACM
— Reverse engineering of large legacy software systems generally cannot meet its objectives because it cannot be cost-effective. There are two main reasons for this. First, it is...
MVA
1992
13 years 8 months ago
1992
In this study, we explore the domain of orthogonal transforms, in order to bring an understanding on the characterization of image features, with emphasis placed on the Karhunen-L...