Sciweavers

152 search results - page 9 / 31
» Sorting by reversals is difficult
Sort
View
COLING
1996
13 years 8 months ago
Reversible delayed lexical choice in a bidirectional framework
We describe a bidirectional framework for natural language parsing and generation, using a typedfeatureformalismand an HPSG-based grammar with a parser and generator derived from ...
Graham Wilcock, Yuji Matsumoto
WCRE
1999
IEEE
13 years 11 months ago
A Formal Approach for Reverse Engineering: A Case Study
As a program evolves, it becomes increasingly difficult to understand and reason about changes in the source code. Eventually, if enough changes are made, reverse engineering and ...
Gerald C. Gannod, Betty H. C. Cheng
AICCSA
2005
IEEE
82views Hardware» more  AICCSA 2005»
13 years 9 months ago
Reverse engineering of framework design using a meta-patterns-based approach
Object-oriented frameworks are a powerful reuse technique but they are also very complex and difficult to design. Framework’s design aims at separating the invariant aspects acr...
Nuno Flores, Ademar Aguiar
SPAA
1996
ACM
13 years 11 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
PVG
2003
IEEE
138views Visualization» more  PVG 2003»
14 years 22 days ago
Sort-First, Distributed Memory Parallel Visualization and Rendering
While commodity computing and graphics hardware has increased in capacity and dropped in cost, it is still quite difficult to make effective use of such systems for general-purpos...
E. Wes Bethel, Greg Humphreys, Brian E. Paul, J. D...