2498 search results - page 318 / 500 » Data Structures with Unpredictable Timing |
156
click to vote
WEA
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. The continuous growth of the routing tables sizes in backbone routers is one of the most compelling scaling problems affecting the Internet and has originated considerab...
184
click to vote
CPM
2005
Springer
15 years 12 months ago
2005
Springer
A succinct full-text self-index is a data structure built on a text T = t1t2 . . . tn, which takes little space (ideally close to that of the compressed text), permits efficient se...
342
Voted
ICS
2001
Tsinghua U.
15 years 11 months ago
2001
Tsinghua U.
For most parallel and high performance systems, tuning guides provide the users with advices to optimize the execution time of their programs. Execution time may be very sensitive...
159
click to vote
ICFP
1998
ACM
15 years 10 months ago
1998
ACM
Intensional polymorphism, the ability to dispatch to different routines based on types at run time, enables a variety of advanced implementation techniques for polymorphic languag...
171
click to vote
WG
1993
Springer
15 years 10 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...