2498 search results - page 204 / 500 » Data Structures with Unpredictable Timing |
94
Voted
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...
111
click to vote
STOC
2002
ACM
16 years 2 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
117
click to vote
SIGSOFT
2008
ACM
16 years 3 months ago
2008
ACM
Framework-intensive applications (e.g., Web applications) heavily use temporary data structures, often resulting in performance bottlenecks. This paper presents an optimized blend...
121
click to vote
ICNP
2005
IEEE
15 years 8 months ago
2005
IEEE
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
145
Voted
INFOCOM
2000
IEEE
15 years 6 months ago
2000
IEEE
-In this paper, we present a fast and scalable pipelined priority queue architecture for use in high-performance switches with support for fine-grained quality of service (QoS) gu...