Filters








38 Hits in 6.8 sec

Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances [article]

Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2022 arXiv   pre-print
We first apply it to our own diameter and eccentricity oracles and then show its versatility by derandomizing algorithms from the literature: the distance sensitivity oracle of Ren [JCSS 2022] and the  ...  This way, we obtain the first deterministic distance sensitivity oracle with subcubic preprocessing time.  ...  Diameter and Eccentricity Oracles This section discusses fault-tolerant oracles for the diameter and vertex eccentricity in directed graphs.  ... 
arXiv:2204.10679v1 fatcat:nm2dizmc7rddbhy6gu4co43wom

Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances

Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck, Mikołaj Bojańczyk, Emanuela Merelli, David P. Woodruff
2022
We first apply it to our own diameter and eccentricity oracles and then show its versatility by derandomizing algorithms from the literature: the distance sensitivity oracle of Ren [JCSS 2022] and the  ...  This way, we obtain the first deterministic distance sensitivity oracle with subcubic preprocessing time.  ...  n)/(ε 2 D 2 )) space, and constant query time. 22:Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances Proof.  ... 
doi:10.4230/lipics.icalp.2022.22 fatcat:xamvrebpnreobngucddl7z3l2m

Space-Efficient Fault-Tolerant Diameter Oracles [article]

Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2021 arXiv   pre-print
We design f-edge fault-tolerant diameter oracles (f-FDOs).  ...  We show that for unweighted graphs with polylogarithmic diameter and up to f = o(log n/ loglog n) failures, one can swap approximation for query time and space.  ...  Suppose we know for each s, t ∈ V some shortest path P (s, t) in G and additionally have access to a distance sensitivity oracle that, for any edge e, reports in constant time the replacement distances  ... 
arXiv:2107.03485v1 fatcat:3a2l7rvbifdyzjiu4q23fhf7uu

Conditional Hardness for Sensitivity Problems

Monika Henzinger, Andrea Lincoln, Stefan Neumann, Virginia Vassilevska Williams, Marc Herbstritt
2017 Innovations in Theoretical Computer Science  
We extend our reduction from BMM to Diameter to give a reduction from All Pairs Shortest Paths to Diameter under one deletion in weighted graphs.  ...  Many of our lower bounds also hold for static oracle data structures where no sensitivity is required.  ...  Diameter Upper Bound In this section, we present deterministic algorithms, which can compute a (1+ε)-approximation for the eccentricity, the radius and the diameter of directed and undirected unweighted  ... 
doi:10.4230/lipics.itcs.2017.26 dblp:conf/innovations/HenzingerL0W17 fatcat:6mw52rwkafcothehbz4nua27wq

Conditional Hardness for Sensitivity Problems [article]

Monika Henzinger, Andrea Lincoln, Stefan Neumann, Virginia Vassilevska Williams
2017 arXiv   pre-print
We give more lower bounds under the Strong Exponential Time Hypothesis and the All Pairs Shortest Paths Conjecture.  ...  Finally, we give the first algorithm for the (1 + ϵ)-approximate radius, diameter, and eccentricity problems in directed or undirected unweighted graphs in case of single edges failures.  ...  Diameter Upper Bound In this section, we present deterministic algorithms, which can compute a (1+ε)-approximation for the eccentricity, the radius and the diameter of directed and undirected unweighted  ... 
arXiv:1703.01638v1 fatcat:udwtdffcebbijku3zkctq4x4ii

Finding Structure in Dynamic Networks [article]

Arnaud Casteigts
2018 arXiv   pre-print
We hope they can serve as a broad introduction to the domain of highly dynamic networks, with a focus on temporal graph concepts and their interaction with distributed computing.  ...  Given the nature of this document, the contributions that involve the author have been emphasized; however, these four chapters were specifically written for distribution to a larger audience.  ...  Unfolding the concept of temporal distance leads to that of temporal diameter and temporal eccentricity [32] .  ... 
arXiv:1807.07801v1 fatcat:oh6e4eqhqbh3vabyqejptfz6cy

Space-Efficient Fault-Tolerant Diameter Oracles

Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck, Filippo Bonchi, Simon J. Puglisi
2021
We design f-edge fault-tolerant diameter oracles (f-FDO, or simply FDO if f = 1).  ...  Many real-world networks have polylogarithmic diameter. We show that for those graphs and up to f = o(log n/ log log n) failures one can swap approximation for query time and space.  ...  Distance oracles for all-pairs distances were introduced in a seminal paper by Thorup and Zwick [42] . Demetrescu et al.  ... 
doi:10.4230/lipics.mfcs.2021.18 fatcat:ydiydkia6bcbxb675wp2dygwh4

Exploring and Exploiting Diversity for Image Segmentation [article]

Payman Yadollahpour
2017 arXiv   pre-print
CRF, CNN, etc.) and optimization algorithm, which makes it applicable to a wide range of models and inference methods.  ...  This thesis investigates the latter and presents a two stage approach to semantic segmentation.  ...  axis length, eccentricity and orientation for an ellipse fit to the region; area of the convex hull of the region and its ratio to the area; Euler number (number of holes); diameter of the disk with area  ... 
arXiv:1709.01625v1 fatcat:hjedzbi37be5hk4pai4hc3oany

Algorithms, parallelism and fine-grained complexity for shortest path problems in sparse graphs [article]

Udit Agarwal, Austin, The University Of Texas At, Vijaya Ramachandran
2020
All of these problems are known to be subcubic equivalent and this shows that achieving sub-mn running time is hard, but only for dense graphs where $m = [Theta] (n²).  ...  In this thesis we present a new approach for computing all pairs k simple shortest paths (k-APSiSP), which is based on forming suitable path extensions to find simple shortest paths; this method is different  ...  Table 3 . 3 1: Our results for directed graphs. All algorithms are deterministic. (DSO stands for Distance Sensitivity Oracles).  ... 
doi:10.26153/tsw/10160 fatcat:sgpa6t43rbfsbkhrb7gmccenmq

Level 3 trigger algorithm and Hardware Platform for the HADES experiment

Daniel Georg Kirschner, Geydar Agakishiev, Ming Liu, Tiago Perez, Wolfgang Kühn, Vladimir Pechenov, Stefano Spataro
2009 Nuclear Instruments and Methods in Physics Research Section A : Accelerators, Spectrometers, Detectors and Associated Equipment  
Its name arises from its property of being responsible for binding quarks into hadrons.  ...  One justication for this analogy is that strongly bound systems in nature have been found to be always color neutral.  ...  The outer diameter of the RICH is about 1, 58 m and the inner gap for target and beam pipe has a diameter of 15 cm. The center of the target is located nearly in the focal point of the mirror.  ... 
doi:10.1016/j.nima.2008.09.054 fatcat:qbg3huhmhjdufic7voggmqys4i

Generation and Uses of Distributed Entanglement in Quantum Information [article]

Zachary David Eldredge
2019
for architectures, such as maximum graph degree and total number of necessary connections.  ...  First, we will discuss the implications of the Lieb-Robinson bound on graph descriptions of quantum computer architectures, and how the relevant graph parameter (diameter) compares to likely cost functions  ...  ), which are, respectively, the weighted diameter and weighted root eccentricity for an i-level weighted hierarchy.  ... 
doi:10.13016/6b1j-tsik fatcat:aqze7a6hf5enbdifjfkjdvb33m

Computation and its limits

2012 ChoiceReviews  
This means that the grammar required for counting, as opposed to saying one number, is context sensitive.  ...  If two wheels contact tangentially and A has diameter a and B has diameter b then the wheel A will rotate at a rate of −b a times the rate of rotation of wheel B.  ...  Chapter 7 Hyper computing proposals There have been many attempts to articulate new systems for computability that are claimed to transcend the limitations of Church-Turing systems, termed for example  ... 
doi:10.5860/choice.50-2108 fatcat:cfmueij4tvetlm4tzgft2aepzm

Themenheft zu Heft 5

(:Unkn) Unknown, Mediarep.Org, Jörg Schirra
2021 Image  
Research was partially funded by the Deutsche Forschungsgemeinschaft and by the German Ministry of Research and Technology. All support is gratefully acknowledged.  ...  for applications, stimulated discussions and helped to improve certain aspects of the above-mentioned tools.  ...  This is not enough for modelling the behaviour of "globally sensitive" organs, which, e.g., react to shadow and can be influenced by parts of the structure that are in a far distance.  ... 
doi:10.25969/mediarep/16743 fatcat:uh3wpotdmjgpjciazcj4cmbjie

Graph parameters: theory, generation and dissemination

Srinibas Swain
2019
We develop an interactive tool that contains more than a billion networks and related parameters.  ...  We also introduce and analyse the problem of finding the most commonly occurring substructure inside a network.  ...  We managed to create a queryable repository of graphs, OLGA, which stores all simple connected unlabelled graphs with up to 10 vertices and more than 25 parameters (refer to Chapter 6 for details) related  ... 
doi:10.26180/5d3926fce0a17 fatcat:rcm5uz53iva4nc3vuu2yvt3rfe

Subject index: Abstracts

1993 Journal of the American College of Cardiology  
Autoregulation in Left Ventricular Hypertrophy: Comparison of Eccentric and Concentric Hypertrophy 780-6. 288A Dahl Salt-Sensitive Rat Is a New Model of Congestive Heart Failure 912-48. 255A Development  ...  Occurs by Membrane Depolarization and Activation of Voltage-Sensitive Ca++ Channels 963-35 • 464A Nucleotide Modulation of Glibenclamide Binding and ATP-Sensitive Potassium Channel Blockade in Vascular  ... 
doi:10.1016/s0735-1097(10)80312-2 fatcat:it6q4uxdhvc4jghxldtyvubrja
« Previous Showing results 1 — 15 out of 38 results