Sciweavers

2100 search results - page 323 / 420
» Fundamentals of the problem
Sort
View
SIBGRAPI
2008
IEEE
14 years 3 months ago
Tradeoffs in Approximate Range Searching Made Simpler
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...
ICALP
2009
Springer
14 years 9 months ago
Annotations in Data Streams
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...
Amit Chakrabarti, Graham Cormode, Andrew McGregor
ICNP
2003
IEEE
14 years 2 months ago
Matchmaker: Signaling for Dynamic Publish/Subscribe Applications
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...
ATAL
2006
Springer
14 years 28 days ago
A context-aware approach for service selection using ontologies
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...
Murat Sensoy, Pinar Yolum
PC
2007
161views Management» more  PC 2007»
13 years 8 months ago
High performance combinatorial algorithm design on the Cell Broadband Engine processor
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...