Search Results - "Dynamic algorithms"

Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs by Behnezhad, Soheil, Ghafari, Alma

“…We study the fully dynamic maximum matching problem. In this problem, the goal is to efficiently maintain an approximate maximum matching of a graph that is subject to edge insertions and deletions…”
Get full text

Fully Dynamic Algorithms for Euclidean Steiner Tree by T-H, Hubert Chan, Goranci, Gramoz, Jiang, Shaofeng H -C, Wang, Bo, Xue, Quan

“…)\)-approximation was obtained in the offline setting in seminal works of Arora and Mitchell, efficient dynamic algorithms for Steiner tree is still open…”
Get full text

A Lossless Deamortization for Dynamic Greedy Set Cover by Solomon, Shay, Uzrad, Amitai, Zhang, Tianyi

“…The dynamic set cover problem has been subject to growing research attention in recent years…”
Get full text

On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability by Krishna, Shankaranarayanan, Lal, Aniket, Pavlogiannis, Andreas, Tuppe, Omkar

“… In the everyday practice of program analysis, the analyzed code is subject to continuous change, with source code being added and removed…”
Get full text

Improved Dynamic Algorithms for Longest Increasing Subsequence by Kociumaka, Tomasz, Seddighin, Saeed

“…We study dynamic algorithms for the longest increasing subsequence (\textsf{LIS}) problem. A dynamic \textsf{LIS} algorithm maintains a sequence subject to operations of the following form arriving one by one…”
Get full text

Dynamic algorithms for classes of constraint satisfaction problems by Frigioni, Daniele, Marchetti-Spaccamela, Alberto, Nanni, Umberto

“…). It is the problem of finding an assignment of values for a set of variables, each defined on a finite domain of feasible values, subject to a given collection of constraints…”
Get full text

Fully dynamic update of arc-flags by D'Angelo, Gianlorenzo, D'Emidio, Mattia, Frigioni, Daniele

“…Best connections in real networks are usually found by applying Dijkstra's shortest paths algorithm. Unfortunately, networks deriving from real‐world…”
Get full text

Topological dynamics algorithms for enhanced cybersecurity protocols by Lenka, Reena Mahapatra, Tiwari, Sudhakar, Dommari, Sandeep, Bhosale, Varsha Kiran, Dass, Pranav, Chavan, Nikita, Tandon, Nitin

“…Topological dynamics is a way to look at the features of changing systems through the lens of topology. It has a lot of potential for making security measures…”
Get full text

Performance of a multisensor smart ring to evaluate sleep: in-lab and home-based evaluation of generalized and personalized algorithms by Grandner, Michael A, Bromberg, Zohar, Hadley, Aaron, Morrell, Zoe, Graf, Arnulf, Hutchison, Stephen, Freckleton, Dustin

“… Subjects participated in a single night of in-lab PSG and two nights of at-home data collection…”
Get full text

A probabilistic ontology-based platform for self-learning context-aware healthcare applications by Ongenae, Femke, Claeys, Maxim, Dupont, Thomas, Kerckhove, Wannes, Verhoeve, Piet, Dhaene, Tom, De Turck, Filip

“… Context-aware platforms consist of dynamic algorithms that take the context information into account to adapt the behavior of the applications…”
Get full text

Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing by Bernstein, Aaron, Gutenberg, Maximilian Probst, Saranurak, Thatchaphol

“…Let G=(V, E, w) be a weighted, directed graph subject to a sequence of adversarial edge deletions…”
Get full text

On Finding Optimal (Dynamic) Arborescences by Espada, Joaquim, Francisco, Alexandre P., Rocher, Tatiana, Russo, Luís M. S., Vaz, Cátia

“…, an optimal arborescence. Furthermore, when G is subject to changes, namely, edge insertions and deletions, we are interested in efficiently maintaining a dynamic arborescence in G…”
Get full text

Common Molecular Dynamics Algorithms Revisited: Accuracy and Optimal Time Steps of Störmer–Leapfrog Integrators by Mazur, Alexy K.

“…The Störmer–Verlet–leapfrog group of integrators commonly used in molecular dynamics simulations has long become a textbook subject and seems to have been studied exhaustively…”
Get full text

A Fully Dynamic Algorithm for Planar Width by Chan, Timothy M.

“…) amortized time per update. Previously, no fully dynamic algorithm with a guaranteed sublinear time bound was known…”
Get full text

A Dynamic Algorithm for Weighted Submodular Cover Problem by Banihashem, Kiarash, Goudarzi, Samira, Hajiaghayi, MohammadTaghi, Jabbarzade, Peyman, Monemizadeh, Morteza

“… \(S \subseteq V\) that minimizes the cost subject to the constraint \(f(S) = f(V)\). This is a classical problem in computer science and generalizes the Set Cover problem, 2-Set Cover, and dominating set problem among others…”
Get full text

Fully Dynamic Evaluation of Sequence Pair by Kozik, A.

“… In this paper, motivated by the significance of the sequence pair (SP) representation for floorplanning, we develop a fully dynamic algorithm of SP evaluation…”
Get full text

Advanced Data Structures and Algorithms: Learn how to enhance data processing with more complex and advanced data structures (English Edition) by A, Abirami, R L, Priya

“… ? A practical guide for students and faculty members who are interested in this important subject area of Computer Science…”
Get full text

An improved spiral dynamic algorithm and its application to fuzzy modelling of a twin rotor system by Nasir, A. N. K., Tokhi, M. O., Omar, M. E., Ghani, N. M. A.

“… Spiral motion and dynamic step size generated by a spiral model produce unique exploration and exploitation strategies of a spiral dynamic algorithm…”
Get full text

Parallel Batch-dynamic Trees via Change Propagation by Acar, Umut A, Anderson, Daniel, Blelloch, Guy E, Dhulipala, Laxman, Westrick, Sam

“… Dynamic trees are a fundamental building block of a large number of graph algorithms. Although traditionally studied in the single-update setting, dynamic algorithms…”
Get full text

Dynamic matchings in left vertex weighted convex bipartite graphs by Zu, Quan, Zhang, Miaomiao, Yu, Bin

“… The graph is subject to the updates of vertex and edge insertions and deletions. Our dynamic algorithms maintain the update operations in O ( log 2 | V…”
Get full text