Searching for Frequent Colors in Rectangles

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We study a new variant of colored orthogonal range searching problem: given a
query rectangle $Q$ all colors $c$, such that at least a fraction $\tau$ of all
points in $Q$ are of color $c$, must be reported. We describe several data
structures for that problem that use pseudo-linear space and answer queries in
poly-logarithmic time.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Searching for Frequent Colors in Rectangles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Searching for Frequent Colors in Rectangles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Searching for Frequent Colors in Rectangles will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-332505

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.