Sciweavers

5746 search results - page 209 / 1150
» Visualizing Query Structure
Sort
View
APVIS
2008
15 years 8 months ago
Interactive Visual Analysis of the NSF Funding Information
This paper presents an interactive visualization toolkit for navigating and analyzing the National Science Foundation (NSF) funding information. Our design builds upon the treemap...
Shixia Liu, Nan Cao, Hao Lv
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
16 years 6 months ago
Optimal static range reporting in one dimension
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
Stephen Alstrup, Gerth Stølting Brodal, The...
ISAAC
2007
Springer
156views Algorithms» more  ISAAC 2007»
16 years 19 days 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
ESA
2004
Springer
160views Algorithms» more  ESA 2004»
15 years 12 months ago
Optimal External Memory Planar Point Enclosure
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
Lars Arge, Vasilis Samoladas, Ke Yi
RIAO
2007
15 years 8 months ago
XML Fragments Extended with Database Operators
XML documents represent a middle range between unstructured data such as textual documents and fully structured data encoded in databases. Typically, information retrieval techniq...
Yosi Mass, Dafna Sheinwald, Benjamin Sznajder, Siv...