ions is lower than the programmer‘s perceived cost of writing them from scratch. << [G. Booch, 1994] Central Question: How can we decrease the effort of building framework-...
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
We describe a tool enabling non-professionals to create digital layouts for large-scale graphical virtual environments. The design tool is based on "elements of the city imag...
Background: Array comparative genomic hybridization (CGH) is a technique which detects copy number differences in DNA segments. Complete sequencing of the human genome and the dev...
Bryan Chi, Ronald J. deLeeuw, Bradley P. Coe, Calu...
This paper describes the LT NSL system (McKelvie et al, 1996), an architecture for writing corpus processing tools. This system is then compared with two other systems which addre...