Sciweavers

1027 search results - page 191 / 206
» Language Support for Connector Abstractions
Sort
View
ACMSE
2011
ACM
12 years 9 months ago
Targeting FPGA-based processors for an implementation-driven compiler construction course
This paper describes the adaptation of a modern compiler construction course to target an FPGA-based hardware platform used throughout our computer science curriculum. One of the ...
D. Brian Larkins, William M. Jones
ICALP
2009
Springer
14 years 9 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro
IPPS
2003
IEEE
14 years 2 months ago
Applying Aspect-Orient Programming Concepts to a Component-Based Programming Model
Abstract— The execution environments For scientific applications have evolved significantly over the years. Vector and parallel architectures have provided significantly faste...
Thomas Eidson, Jack Dongarra, Victor Eijkhout
SIGIR
1998
ACM
14 years 1 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
CHI
1997
ACM
14 years 1 months ago
MOBI-D: A Model-Based Development Environment for User-Centered Design
MOBI-D (Model-Based Interface Designer) is a software environment the design and development of user interfaces from declarative interface models. End-users informally describe ta...
Angel R. Puerta, David Maulsby