Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CCCG
2008

favoriteEmaildiscussreport

108views Computational Geometry» more CCCG 2008»

Searching for Frequent Colors in Rectangles

13 years 6 months ago

Searching for Frequent Colors in Rectangles

Download cccg.ca

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 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.

Marek Karpinski, Yakov Nekrich

Real-time Traffic

CCCG 2008 | Color C | Computational Geometry | Query Rectangle | Range Searching Problem |

claim paper

Related Content

» Mining for Empty Rectangles in Large Data Sets

» Visual Object Detection using Frequent Pattern Mining

» Towards detection of orthogonal planes in monocular images of indoor environments

» A picture is worth a thousand search results finding childoriented multimedia results with...

» Constrained reverse nearest neighbor search on mobile objects

» Evolutionary Reproduction of Dutch Masters The Mondriaan and Escher Evolvers

» Generic Object Detection using Model Based Segmentation

» Camera notes

» Mining Visual and Textual Data for Constructing a MultiModal Thesaurus

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	CCCG
Authors	Marek Karpinski, Yakov Nekrich

Comments (0)