Sciweavers

1448 search results - page 128 / 290
» From Requirements to Code Revisited
Sort
View
CODES
2004
IEEE
15 years 7 months ago
Operation tables for scheduling in the presence of incomplete bypassing
Register bypassing is a powerful and widely used feature in modern processors to eliminate certain data hazards. Although complete bypassing is ideal for performance, bypassing ha...
Aviral Shrivastava, Eugene Earlie, Nikil D. Dutt, ...
ANLP
2000
149views more  ANLP 2000»
15 years 5 months ago
Javox: A Toolkit for Building Speech-Enabled Applications
JAVOX provides a mechanism for the development of spoken-language systems from existing desktop applications. We present an architecture that allows existing Java1 programs to be ...
Michael S. Fulkerson, Alan W. Biermann
IJPP
2002
107views more  IJPP 2002»
15 years 3 months ago
Efficiently Adapting Java Binaries in Limited Memory Contexts
This paper presents a compilation framework that allows executable code to be shared across different Java Virtual Machine (JVM) instances. All fully compliant JVMs that target se...
Pramod G. Joisha, Samuel P. Midkiff, Mauricio J. S...
AOSD
2011
ACM
14 years 11 months ago
Closure joinpoints: block joinpoints without surprises
Block joinpoints allow programmers to explicitly mark regions of base code as “to be advised”, thus avoiding the need to extract the block into a method just for the sake of c...
Eric Bodden
IPPS
2003
IEEE
15 years 9 months ago
A Compilation Framework for Distributed Memory Parallelization of Data Mining Algorithms
With the availability of large datasets in a variety of scientific and commercial domains, data mining has emerged as an important area within the last decade. Data mining techni...
Xiaogang Li, Ruoming Jin, Gagan Agrawal