Sciweavers

8540 search results - page 407 / 1708
» The Dynamic Servers Problem
Sort
View
EDBT
2009
ACM
108views Database» more  EDBT 2009»
15 years 9 months ago
Reverse k-nearest neighbor search in dynamic and general metric databases
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...
Elke Achtert, Hans-Peter Kriegel, Peer Kröger...
POPL
1999
ACM
15 years 9 months ago
Software Watermarking: Models and Dynamic Embeddings
Watermarking embeds a secret message into a cover message. In media watermarking the secret is usually a copyright notice and the cover a digital image. Watermarking an object dis...
Christian S. Collberg, Clark D. Thomborson
ICNP
1999
IEEE
15 years 9 months ago
Dynamic Memory Model Based Framework for Optimization of IP Address Lookup Algorithms
The design of software-based algorithms for fast IP address lookup targeted for general purpose processors has received tremendous attention in recent years due to its low cost im...
Gene Cheung, Steven McCanne
IPPS
1999
IEEE
15 years 9 months ago
Portable Parallel Programming for the Dynamic Load Balancing of Unstructured Grid Applications
The ability to dynamically adapt an unstructured grid (or mesh) is a powerful tool for solving computational problems with evolving physical features; however, an efficient parall...
Rupak Biswas, Leonid Oliker, Sajal K. Das, Daniel ...
IPPS
1998
IEEE
15 years 9 months ago
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot