Sciweavers

102 search results - page 4 / 21
» Data Structures for Reporting Extension Violations in a Quer...
Sort
View
VLDB
2001
ACM
114views Database» more  VLDB 2001»
13 years 12 months ago
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports
Estimating the number of distinct values is a wellstudied problem, due to its frequent occurrence in queries and its importance in selecting good query plans. Previous work has sh...
Phillip B. Gibbons
ISAAC
2007
Springer
156views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Approximate Range Searching in External Memory
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
Micha Streppel, Ke Yi
WADS
2009
Springer
268views Algorithms» more  WADS 2009»
14 years 2 months ago
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
Prosenjit Bose, Meng He, Anil Maheshwari, Pat Mori...
BMCBI
2007
167views more  BMCBI 2007»
13 years 7 months ago
MindSeer: a portable and extensible tool for visualization of structural and functional neuroimaging data
Background: Three-dimensional (3-D) visualization of multimodality neuroimaging data provides a powerful technique for viewing the relationship between structure and function. A n...
Eider B. Moore, Andrew V. Poliakov, Peter Lincoln,...
MICS
2010
137views more  MICS 2010»
13 years 5 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun