E-viri
Recenzirano
Odprti dostop
-
Ishiyama, Kazuki; Sadakane, Kunihiko
Information and computation, August 2020, 2020-08-00, Letnik: 273Journal Article
We introduce compact and succinct representations of a d-dimensional point set for any constant d≥3 supporting orthogonal range searching. Our first data structure uses dnlgn+o(nlgn) bits, where n denotes the number of points in P, and supporting reporting queries in O((n(d−2)/d+occ)lgn/lglgn) time, and counting queries in O(n(d−2)/dlgn/lglgn) time, where occ denotes the number of point to report, which is faster than known algorithms. Our second data structure uses dnlgU−nlgn+o(nlgn) bits, where U is the size of the universe, which asymptotically matches the information-theoretic lower bound. The query time complexity is worse than the first one, but the algorithm runs fast in practical database search.
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Vnos na polico
Trajna povezava
- URL:
Faktor vpliva
Dostop do baze podatkov JCR je dovoljen samo uporabnikom iz Slovenije. Vaš trenutni IP-naslov ni na seznamu dovoljenih za dostop, zato je potrebna avtentikacija z ustreznim računom AAI.
Leto | Faktor vpliva | Izdaja | Kategorija | Razvrstitev | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Baze podatkov, v katerih je revija indeksirana
Ime baze podatkov | Področje | Leto |
---|
Povezave do osebnih bibliografij avtorjev | Povezave do podatkov o raziskovalcih v sistemu SICRIS |
---|
Vir: Osebne bibliografije
in: SICRIS
To gradivo vam je dostopno v celotnem besedilu. Če kljub temu želite naročiti gradivo, kliknite gumb Nadaljuj.