Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
The publish/subscribe (pub/sub) paradigm provides content-oriented data dissemination in which communication channels are established between content publishers and content subscr...
Zihui Ge, Ping Ji, James F. Kurose, Donald F. Tows...
Selecting the right parties to interact with is a fundamental problem in open and dynamic environments. The problem is exemplified when the number of interacting parties is high a...
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-process...
David A. Bader, Virat Agarwal, Kamesh Madduri, Seu...