نتایج جستجو برای: expected profile update time
تعداد نتایج: 2309343 فیلتر نتایج به سال:
The original cohort study of AHAP started in 2011 on 1616 elderly residents of Amirkola, northern part of Iran near the Caspian Sea. The main goal of this study was to comprehensively evaluate the health of the elderly in the region with the emphasis on chronic diseases such as osteoporosis. The first cohort profile was published in the International Journal of Epidemiology in 2014. The phase 1...
We present and analyze e cient new algorithms for generating a random variate distributed according to a dynamically changing set of weights. The base version of each algorithm generates the discrete random variate in O(log N) expected time and updates a weight in O(2log N ) expected time in the worst case. We then show how to reduce the update time to O(log N) amortized expected time. The algo...
We consider PATRICIA tries on n random binary strings generated by a memoryless source with parameter p ≥ 1 2 . For both the symmetric (p = 1/2) and asymmetric cases, we analyze asymptotics of the expected value of the external profile at level k = k(n), defined to be the number of leaves at level k. We study three natural ranges of k with respect to n. For k bounded, the mean profile decays ex...
A digital search tree (DST) is a fundamental data structure on words that finds various applications from the popular Lempel-Ziv’78 data compression scheme to distributed hash tables. The profile of a DST measures the number of nodes at the same distance from the root; it depends on the number of stored strings and the distance from the root. Most parameters of DST (e.g., depth, height, fillup)...
We first propose a general game-theoretic framework for studying engineering systems consisting of interacting (sub)systems. Our framework enables us to capture the delays often present in engineering systems as well as asynchronous operations of systems. We model the interactions among the systems using a repeated game and provide a new simple learning rule for the players representing the sys...
We study the fully-dynamic all pairs shortest path problem for graphs with arbitrary non-negative edge weights. It is known for digraphs that an update of the distance matrix costs O(n2.75 polylog(n)) worst-case time [Thorup, STOC ’05] and O(n2 log(n)) amortized time [Demetrescu and Italiano, J.ACM ’04] where n is the number of vertices. We present the first average-case analysis of the undirec...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید