Let S be a set of n points in an [n] grid, such that each point is assigned a color. Given a query range Q = [a1, b1] × [a2, b2] × . . . × [ad, bd], the geometric range mode query problem asks to report the most frequent color (i.e., a mode) of the multiset of colors corresponding to points in S ∩ Q. When d = 1, Chan et al. (STACS 2012 [2]) gave a data structure that requires O(n + (n/∆)/w) wor...

Video contents now represent the biggest share of Internet traffic in terms of volume. Nextflix is responsible for 71% of the bandwidth consumed at peak hours in the US, a two-fold increase as compared to 2011, according to the last quarterly report of Sandvine [14]. On average, Netflix consumed 35,2%, followed by YouTube (17,5%) and Amazon Video (4,3%). This heavy trend points toward the need ...

Given the lower bound of (n(d 1)=d) for range query time complexity on n d-dimensional point data, we investigate whether little replication can improve the query and update times significantly. We propose linear-space index structures that minimize the query and update times; the query time we achieve is O(n ) for any > 0, and, the update time is O(logn).

Video recording and photography are frequently used to document Cultural Heritage (CH) objects and sites. High Dynamic Range (HDR) imaging is increasingly being used as it allows a wider range of light to be considered that most current technologies are unable to natively acquire and reproduce. HDR video content however has only recently become possible at desirable, high definition resolution ...