Sciweavers

9842 search results - page 269 / 1969
» Compositional timing analysis
Sort
View
IBPRIA
2003
Springer
15 years 9 months ago
Hash-Like Fractal Image Compression with Linear Execution Time
The main computational cost in Fractal Image Analysis (FIC) comes from the required range-domain full block comparisons. In this work we propose a new algorithm for this comparison...
Kostadin Koroutchev, José R. Dorronsoro
SIGACT
1998
105views more  SIGACT 1998»
15 years 4 months ago
Everything you wanted to know about the running time of Mergesort but were afraid to ask
Although mergesort is an algorithm that is frequently glossed over in textbooks, it provides fertile ground for planting ideas about algorithm analysis in the minds of students. A...
Ian Parberry
IEEECIT
2010
IEEE
15 years 3 months ago
Mixed-Criticality Real-Time Scheduling for Multicore Systems
Current hard real-time scheduling and analysis techniques are unable to efficiently utilize the computational bandwidth provided by multicore platforms. This is due to the large ...
Malcolm S. Mollison, Jeremy P. Erickson, James H. ...
ISORC
2011
IEEE
14 years 8 months ago
A Time-Predictable Object Cache
—Static cache analysis for data allocated on the heap is practically impossible for standard data caches. We propose a distinct object cache for heap allocated data. The cache is...
Martin Schoeberl
250
Voted
VLDB
2005
ACM
152views Database» more  VLDB 2005»
16 years 4 months ago
Composing, optimizing, and executing plans for bioinformatics web services
The emergence of a large number of bioinformatics datasets on the Internet has resulted in the need for flexible and efficient approaches to integrate information from multiple bio...
Snehal Thakkar, José Luis Ambite, Craig A. Knoblo...