Sciweavers

4541 search results - page 463 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
SAS
2007
Springer
15 years 11 months ago
Modular Safety Checking for Fine-Grained Concurrency
Concurrent programs are difficult to verify because the proof must consider the interactions between the threads. Fine-grained concurrency and heap allocated data structures exacer...
Cristiano Calcagno, Matthew J. Parkinson, Viktor V...
ICPPW
2003
IEEE
15 years 10 months ago
Parallelization of Cellular Neural Networks for Image Processing on Cluster Architectures
In this paper a simple but effective approach for parallelization of cellular neural networks for image processing is developed. Digital gray-scale images were used to evaluate th...
Thomas Weishäupl, Erich Schikuta
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
15 years 5 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
CIKM
2011
Springer
14 years 5 months ago
MTopS: scalable processing of continuous top-k multi-query workloads
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
Avani Shastri, Di Yang, Elke A. Rundensteiner, Mat...
VIS
2004
IEEE
111views Visualization» more  VIS 2004»
16 years 6 months ago
Importance-Driven Volume Rendering
This paper introduces importance-driven volume rendering as a novel technique for automatic focus and context display of volumetric data. Our technique is a generalization of cut-...
Armin Kanitsar, Eduard Gröller, Ivan Viola