1452 search results - page 168 / 291 » Algorithmic Analysis of Array-Accessing Programs |
106
Voted
CORR
2010
Springer
15 years 23 days ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
88
Voted
ACCV
1998
Springer
15 years 4 months ago
1998
Springer
A new paradigm, the minimization of errors in synthesized images, is introduced to organically combine Computer Vision and Computer Graphics for Virtual Reality applications. Based...
119
click to vote
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
127
click to vote
HPCC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Tracing parallel programs to observe their performance introduces intrusion as the result of trace measurement overhead. If post-mortem trace analysis does not compensate...
144
click to vote
ICSM
2003
IEEE
15 years 6 months ago
2003
IEEE
In object oriented programming, the functionalities of a system result from the interactions (message exchanges) among the objects allocated by the system. While designing object ...