2498 search results - page 235 / 500 » Data Structures with Unpredictable Timing |
127
Voted
MICS
2010
15 years 1 months ago
2010
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
140
click to vote
AVI
2010
15 years 4 months ago
2010
Visualisations of dynamic networks are animated over time, reflecting changes in the underlying data structure. As viewers of these visualisations, it is up to us to accurately pe...
134
click to vote
SODA
2000
ACM
15 years 3 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
102
click to vote
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] mus...
101
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...