698 search results - page 96 / 140 » dagstuhl 2007 |
126
click to vote
DAGSTUHL
1997
15 years 1 months ago
1997
Interactive rendering of large data sets requires fast algorithms and rapid hardware acceleration. Both can be improved, but none of this ensures interactive response times. If a ...
86
Voted
DAGSTUHL
1993
15 years 1 months ago
1993
In this paper we present a type system for graph rewrite systems: uniqueness typing. It employs usage information to deduce whether an object is `unique' at a certain moment,...
117
Voted
DAGSTUHL
1996
15 years 1 months ago
1996
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
101
Voted
DAGSTUHL
1996
15 years 1 months ago
1996
Abstract. Most applications of competitive analysis have involved online problems where a candidate on-line algorithm must compete on some input sequence against an optimal o -line...
89
Voted
DAGSTUHL
1996
15 years 1 months ago
1996
This paper reports on an approachfor improvingthe understandingof old programs which have become very complex due to numerous extensions. We have adapted partial evaluation techni...