Sciweavers

1312 search results - page 157 / 263
» Formally Optimal Boxing
Sort
View
IFL
2003
Springer
128views Formal Methods» more  IFL 2003»
14 years 2 months ago
With-Loop Scalarization - Merging Nested Array Operations
Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, na¨ıve compilation of suc...
Clemens Grelck, Sven-Bodo Scholz, Kai Trojahner
CODES
2002
IEEE
14 years 2 months ago
The design context of concurrent computation systems
Design for performance-optimization of programmable, semicustom SoCs requires the ability to model and optimize the behavior of the system as a whole. Neither the hardware-testben...
JoAnn M. Paul, Christopher M. Eatedali, Donald E. ...
ICDCSW
2002
IEEE
14 years 2 months ago
Efficient Massive Sharing of Content among Peers
In this paper we focus on the design of high performance peer-to-peer content sharing systems. In particular, our goal is to achieve global load balancing and short user-request r...
Peter Triantafillou, Chryssani Xiruhaki, Manolis K...
ISMIR
2001
Springer
100views Music» more  ISMIR 2001»
14 years 2 months ago
Efficient Multidimensional Searching Routines
The problem of Music Information Retrieval can often be formalized as “searching for multidimensional trajectories”. It is well known that string-matching techniques provide r...
Josh Reiss
ISSS
2000
IEEE
111views Hardware» more  ISSS 2000»
14 years 2 months ago
Systematic Data Reuse Exploration Methodology for Irregular Access Patterns
Efficient use of an optimized custom memory hierarchy to exploit temporal locality in the memory accesses on array signals can have a very large impact on the power consumption i...
Tanja Van Achteren, Rudy Lauwereins, Francky Catth...