Wednesday, April 4, 2018

Wednesday, April 4, 2018 12:00 PM EDT

Feng-Xuan Choo, PhD candidate
David R. Cheriton School of Computer Science

Wednesday, April 4, 2018 1:30 PM EDT

Hicham El-Zein, PhD candidate
David R. Cheriton School of Computer Science

We present succinct data structures for one-dimensional color reporting and color counting problems. We are given a set of $n$ points with integer coordinates in the range $[1,m]$ and every point is assigned a color from the set $\{\,1,\ldots,\sigma\,\}$. A color reporting query asks for the list of distinct colors that occur in a query interval $[a,b]$ and a color counting query asks for the number of distinct colors in $[a,b]$.

Wednesday, April 4, 2018 3:00 PM EDT

Thad Starner, School of Interactive Computing
Georgia Institute of Technology

S M T W T F S
25
26
27
28
29
30
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
  1. 2024 (96)
    1. April (19)
    2. March (27)
    3. February (25)
    4. January (25)
  2. 2023 (296)
    1. December (20)
    2. November (28)
    3. October (15)
    4. September (25)
    5. August (30)
    6. July (30)
    7. June (22)
    8. May (23)
    9. April (32)
    10. March (31)
    11. February (18)
    12. January (22)
  3. 2022 (245)
  4. 2021 (210)
  5. 2020 (217)
  6. 2019 (255)
  7. 2018 (217)
    1. December (16)
    2. November (19)
    3. October (24)
    4. September (21)
    5. August (17)
    6. July (20)
    7. June (13)
    8. May (25)
    9. April (34)
    10. March (24)
    11. February (3)
    12. January (1)
  8. 2017 (36)
  9. 2016 (21)
  10. 2015 (36)
  11. 2014 (33)
  12. 2013 (23)
  13. 2012 (4)
  14. 2011 (1)
  15. 2010 (1)
  16. 2009 (1)
  17. 2008 (1)