Sciweavers

2962 search results - page 510 / 593
» Optimizing Spatial Data Structures For Static Data
Sort
View
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
14 years 8 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
EUROGRAPHICS
2010
Eurographics
14 years 3 months ago
Fast Ray Sorting and Breadth-First Packet Traversal for GPU Ray Tracing
We present a novel approach to ray tracing execution on commodity graphics hardware using CUDA. We decompose a standard ray tracing algorithm into several data-parallel stages tha...
Kirill Garanzha and Charles Loop
EDBT
2009
ACM
241views Database» more  EDBT 2009»
14 years 2 months ago
GADDI: distance index based subgraph matching in biological networks
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
Shijie Zhang, Shirong Li, Jiong Yang
IPSN
2009
Springer
14 years 2 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
ATAL
2009
Springer
14 years 2 months ago
Generalization risk minimization in empirical game models
Experimental analysis of agent strategies in multiagent systems presents a tradeoff between granularity and statistical confidence. Collecting a large amount of data about each s...
Patrick R. Jordan, Michael P. Wellman