Sciweavers

110 search results - page 6 / 22
» Data-Parallel R-Tree Algorithms
Sort
View
MICRO
2012
IEEE
285views Hardware» more  MICRO 2012»
12 years 6 days ago
Automatic Extraction of Coarse-Grained Data-Flow Threads from Imperative Programs
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
Feng Li, Antoniu Pop, Albert Cohen
DAGSTUHL
2007
13 years 11 months ago
Parallelism through Digital Circuit Design
Abstract. Two ways to exploit chips with a very large number of transistors are multicore processors and programmable logic chips. Some data parallel algorithms can be executed eï¬...
John O'Donnell
CIKM
2003
Springer
14 years 3 months ago
Hierarchical graph indexing
Traffic analysis, in the context of Telecommunications or Internet and Web data, is crucial for large network operations. Data in such networks is often provided as large graphs w...
James Abello, Yannis Kotidis
VLDB
1994
ACM
129views Database» more  VLDB 1994»
14 years 1 months ago
Hilbert R-tree: An Improved R-tree using Fractals
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
Ibrahim Kamel, Christos Faloutsos
PRIS
2004
13 years 11 months ago
Similarity Range Queries in Streaming Time Series
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...
Maria Kontaki, Apostolos Papadopoulos, Yannis Mano...