Sciweavers

4541 search results - page 21 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ESA
2010
Springer
179views Algorithms» more  ESA 2010»
13 years 8 months ago
On Space Efficient Two Dimensional Range Minimum Data Structures
The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m
Gerth Stølting Brodal, Pooya Davoodi, S. Sr...
WWW
2004
ACM
14 years 9 months ago
Index structures and algorithms for querying distributed RDF repositories
A technical infrastructure for storing, querying and managing RDF data is a key element in the current semantic web development. Systems like Jena, Sesame or the ICS-FORTH RDF Sui...
Heiner Stuckenschmidt, Richard Vdovjak, Geert-Jan ...
ESCAPE
2007
Springer
266views Algorithms» more  ESCAPE 2007»
14 years 2 months ago
CR-precis: A Deterministic Summary Structure for Update Data Streams
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
Sumit Ganguly, Anirban Majumder
DMIN
2007
110views Data Mining» more  DMIN 2007»
13 years 10 months ago
Mining for Structural Anomalies in Graph-based Data
—In this paper we present graph-based approaches to mining for anomalies in domains where the anomalies consist of unexpected entity/relationship alterations that closely resembl...
William Eberle, Lawrence B. Holder
SODA
2010
ACM
409views Algorithms» more  SODA 2010»
14 years 5 months ago
Data Structures for Range Minimum Queries in Multidimensional Arrays
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...
Hao Yuan, Mikhail J. Atallah