17789 search results - page 3235 / 3558 » Exceptional Use Cases |
187
click to vote
INFOCOM
2003
IEEE
16 years 15 hour ago
2003
IEEE
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
154
Voted
ISCA
2003
IEEE
16 years 13 hour ago
2003
IEEE
Many future shared-memory multiprocessor servers will both target commercial workloads and use highly-integrated “glueless” designs. Implementing low-latency cache coherence i...
192
click to vote
MICRO
2003
IEEE
16 years 8 hour ago
2003
IEEE
With faster CPU clocks and wider pipelines, all relevant microarchitecture components should scale accordingly. There have been many proposals for scaling the issue queue, registe...
173
click to vote
COMPGEOM
2003
ACM
15 years 12 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
186
click to vote
COMPGEOM
2003
ACM
15 years 12 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...