Sciweavers

426 search results - page 29 / 86
» Run lengths and liquidity
Sort
View
DATE
2002
IEEE
141views Hardware» more  DATE 2002»
14 years 2 months ago
A Data Analysis Method for Software Performance Prediction
This paper explores the role of data analysis methods to support system-level designers in characterising the performance of embedded applications. In particular, we address the p...
Gianluca Bontempi, Wido Kruijtzer
ISCAS
2002
IEEE
80views Hardware» more  ISCAS 2002»
14 years 2 months ago
FRM based FIR filter design - the WLS approach
Frequency-response masking (FRM) technique produces a filter network which comprises several sub-filters with very sparse coefficient values. If the sub-filters are optimized ...
Ya Jun Yu, Yong Ching Lim
TACAS
1999
Springer
91views Algorithms» more  TACAS 1999»
14 years 2 months ago
Timed Diagnostics for Reachability Properties
We consider the problem of computing concrete diagnostics for timed automata and reachability properties. Concrete means containing information both about the discrete state change...
Stavros Tripakis
IPPS
1997
IEEE
14 years 2 months ago
Work-Time Optimal K-Merge Algorithms on the PRAM
The k-merge problem, given a collection of k, (2  k  n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu
CIAC
2000
Springer
121views Algorithms» more  CIAC 2000»
14 years 1 months ago
An Efficient Algorithm for the Approximate Median Selection Problem
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
Sebastiano Battiato, Domenico Cantone, Dario Catal...