作者: Paz Carmi , Farah Chanchary , Anil Maheshwari , Michiel Smid
DOI: 10.1142/S0218195919500092
关键词:
摘要: 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 < α1 α2 αc 1. P = P1 P2 Pc set of n points d, for some fixed d. For i 1, 2,c, each Pi associated probability αi existence. A p (x1,xd) on layer if there no other q (x1′,x d′) such that x1′ x 1,x2′ 2, and xd′ Consider random subset obtained by including, independently αi. interval [i,j], ≤ j, we report Pi,j (pi,pj) has highest O(1) time O(nlog n) space. solve special as follows. sequence d given (d ≥ 2), where (0, 1] existence it. Given [i,j] an integer t pt O(logdn) O(nlogdn) second consider common element problem. {1, 2,n} universe. S1,S1,Sm subsets 1,m 1,n, added Sp αpi (independently choices). τ real number indices p, q, 1 m j n, decide whether exists k Pr(k nr=pqS r) O(mn) space these elements O(log + w) time, w size output.