This paper is an account of some of the more instructive experiences we gained as we sought to ensure that our information technology training programs kept pace with a fast chang...
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
A dynamic optimizer is a software-based system that performs code modifications at runtime, and several such systems have been proposed over the past several years. These systems ...
The majority of today’s Internet-based services are generally not concerned about the level of Quality of Service (QoS) presented to their users. For many such services, however...
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...