Name
Abstract | ||
|---|---|---|
We study data structures to answer window queries using stochastic input sequences. The first problem is the most likely maximal point in a query window: Let α1,…,αc be constants, with 0 \u003c α1 \u003c α2 ... |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1142/S0218195919500092 | Int. J. Comput. Geom. Appl. |
DocType | Volume | Issue |
Journal | 29 | 4 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paz Carmi | 1 | 321 | 43.14 |
| Farah Chanchary | 2 | 0 | 1.69 |
| Anil Maheshwari | 3 | 869 | 104.47 |
| Michiel H. M. Smid | 4 | 550 | 93.58 |