نتایج جستجو برای: Expected Profile Update Time

تعداد نتایج: 2309343  

Distributed Denial of Service (DDoS) is a common attack in recent years that can deplete the bandwidth of victim nodes by flooding packets. Based on the type and quantity of traffic used for the attack and the exploited vulnerability of the target, DDoS attacks are grouped into three categories as Volumetric attacks, Protocol attacks and Application attacks. The volumetric attack, which the pro...

Journal: :ITA 1996
Paola Alimonti Stefano Leonardi Alberto Marchetti-Spaccamela

We consider the problem of maintaining the transitive closure in a directed graph under edge insertions and deletions from the point of view of average case analysis. Say n the number of nodes and m the number of edges. We present a data structure that supports the report of a path between two nodes in O(nlog n) expected time and O(1) amortized time per update, and reachability queries in O(1) ...

2012
Surender Baswana Manoj Gupta

We present an algorithm for maintaining maximal matching in a graph under addition and deletion of edges. Our data structure is randomized that takes O(log n) expected amortized time for each edge update where n is the number of vertices in the graph. While there is a trivial O(n) algorithm for edge update, the previous best known result for this problem was due to Ivković and Llyod[4]. For a g...

2015
Marcel Goldberg Annette Leclerc Marie Zins Paul Vaillant

The original GAZEL cohort was composed of 20 625 employees of the French national gas and electricity companies (15 011 male employees then aged 40 to 50 years and 5614 women between 35 and 50 years old) at its inception in 1989. A Cohort Profile article was published in 2007. By the end of 2013, participants were aged 60–75, and almost all of them retired during follow-up. Accordingly, the mai...

Journal: :The Journal of Thoracic and Cardiovascular Surgery 2021

Journal: :Theoretical Computer Science 2016

1993
David Eppstein

We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log n) time per update in Mulmuley’s expected-case model of dynamic geometric computation. We use as subroutines dynamic algorithms for two other geometric graphs: the farthest neighbor forest and the rotating caliper graph related to an algorithm for static computation of point set widths and d...

Journal: :European journal of dental education : official journal of the Association for Dental Education in Europe 2010
J Cowpe A Plasschaert W Harzer H Vinkka-Puhakka A D Walmsley

This paper presents the profile and competences for the European Dentist as approved by the General Assembly of the Association for Dental Education in Europe at its annual meeting held in Helsinki in August 2009. A new taskforce was convened to update the previous document published in 2005. The updated document was then sent to all European Dental Schools, ministries of health, national denta...

Journal: :Journal of Combinatorial Theory, Series A 2011

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید