11231 search results - page 251 / 2247 » Digging for Data Structures |
185
click to vote
FOCS
2005
IEEE
16 years 6 days ago
2005
IEEE
This paper proves ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
178
click to vote
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
141
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
180
click to vote
WISE
2002
Springer
15 years 11 months ago
2002
Springer
—Knowledge inference from semi-structured data can utilize frequent sub structures, in addition to frequency of data items. In fact, the working assumption of the present study i...
177
click to vote
TOOLS
2000
IEEE
15 years 11 months ago
2000
IEEE
Many data objects in the real world have attributes about location and time. Such spatiotemporal objects can be found in applications such Geographic Information Systems (GIS), env...