182 search results - page 4 / 37 » Approximate Colored Range Queries |
MICS
2010
14 years 8 months ago
2010
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...
112
click to vote
PERCOM
2005
ACM
15 years 3 months ago
2005
ACM
A distributed system for approximate query answering on sensor network data is proposed, where a suitable compression technique is exploited to represent data and support query an...
77
Voted
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] mus...
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
ICDT
2001
ACM
15 years 2 months ago
2001
ACM
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...