3,399 Hits in 6.8 sec

Restless reachability problems in temporal graphs [article]

Suhas Thejaswi, Juho Lauri, Aristides Gionis
2021 arXiv   pre-print
In addition, we prove that the algorithms presented for the restless reachability problems in vertex-colored temporal graphs are optimal under plausible complexity-theoretic assumptions.  ...  We present an algebraic algorithmic framework based on constrained multilinear sieving for solving the restless reachability problems we propose.  ...  ACKNOWLEDGMENTS We acknowledge the support of Aalto Science-IT with computational resources.  ... 
arXiv:2010.08423v4 fatcat:pcii3wnqvrditjsv4a2umpommy

Graph Homomorphism Polynomials: Algorithms and Complexity [article]

Balagopal Komarath, Anurag Pandey, C. S. Rahul
2020 arXiv   pre-print
and the treewidth of the pattern graph respectively.  ...  Moreover, our proofs rediscover fine-grained separations between these models for constant-degree polynomials.  ...  resp.), thus giving us a fine-grained separation between these models.  ... 
arXiv:2011.04778v2 fatcat:23bzgro5snf6bazzsykubzzfou

Average-case fine-grained hardness

Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
2017 Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017  
from the study of fine-grained complexity.  ...  The focus of these papers has been on using the algebraic structure and low-degree of the polynomials to delegate computation of fine-grained problems in quickly verifiable ways.  ...  Acknowledgements We would like to thank Amir Abboud for suggesting a barrier to achieving low-degree polynomials for EDIT-DISTANCE (Section 2.2) and for pointing us to the Triangle-Collection problem in  ... 
doi:10.1145/3055399.3055466 dblp:conf/stoc/BallRSV17 fatcat:a7xcqudairelvngogbqi245ltu

Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness

Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz, Michael Wagner
2019 International Symposium on Mathematical Foundations of Computer Science  
Very recently [IPEC 18], two of the authors introduced a novel technique for the complexity analysis of #IndSub(Φ), inspired by the "topological approach to evasiveness" of Kahn, Saks and Sturtevant [FOCS  ...  We study the problem #IndSub(Φ) of counting all induced subgraphs of size k in a graph G that satisfy the property Φ.  ...  As a next step towards a proof of Conjecture 1, we suggest the study of properties that are defined by forbidden induced subgraphs, for which the complexity of #IndSub(Φ) is only partially resolved at  ... 
doi:10.4230/lipics.mfcs.2019.26 dblp:conf/mfcs/DorflerRSW19 fatcat:n4mlfouyavbchdyt5sedb5amfq

Computational Counting (Dagstuhl Seminar 18341)

Ivona Bezáková, Leslie Ann Goldberg, Mark R. Jerrum, Marc Herbstritt
2018 Dagstuhl Reports  
This report documents the program and the outcomes of Dagstuhl Seminar 17341 "Computational Counting".  ...  A total of 43 researchers from all over the world, with interests and expertise in different aspects of computational counting, actively participated in the meeting.  ...  URL The main problems in fine-grained complexity are CNF-SAT, the Orthogonal Vectors problem, 3SUM, and the Negative-Weight Triangle problem (which is closely related to  ... 
doi:10.4230/dagrep.7.8.23 dblp:journals/dagstuhl-reports/BezakovaGJ17 fatcat:yp3oqvgo4fal5lbio5yeqt4uje

Software defined architectures for data analytics

Vito Giovanni Castellana, Marco Minutoli, Antonino Tumeo, Marco Lattuada, Pietro Fezzardi, Fabrizio Ferrandi
2019 Proceedings of the 24th Asia and South Pacific Design Automation Conference on - ASPDAC '19  
However, their fine-grained nature still leads to issues for the design software and still makes dynamic reconfiguration impractical.  ...  Data analytics applications increasingly are complex workflows composed of phases with very different program behaviors (e.g., graph algorithms and machine learning, algorithms operating on sparse and  ...  For example, Figure 2 describes resource mapping as a coloring problem over an HTG. A feasible mapping is found when all of the HTG nodes have been colored.  ... 
doi:10.1145/3287624.3288754 dblp:conf/aspdac/CastellanaMTLFF19 fatcat:ip4n6z5ghzdubmzs7g6vsq3jmu


2006 International Journal of Bifurcation and Chaos in Applied Sciences and Engineering  
In this approach, the numerical tasks for the conceptually existing but unavailable coarse-grained equations are implemented through short bursts of appropriately initialized simulations of the "fine-scale  ...  We present an equation-free multi-scale approach to the computational study of the collective dynamics of the Kuramoto model [ Chemical Oscillations, Waves, and Turbulence, Springer-Verlag (1984)], a prototype  ...  This work was partially supported by AFOSR (Dynamics and Control) and an NSF ITR grant. It is a pleasure to acknowledge discussions with Dr.  ... 
doi:10.1142/s021812740601588x fatcat:lss3gsme2fdujjwhhrnrfbcrhi

Book reports

1991 Computers and Mathematics with Applications  
Fine grain parallelization and the wavefront method. 2. Visual extensions to parallel programming languages. 3. A status report on CONSUL. 4. A theory of loop permutations. 5.  ...  Optimization problems. 3. Graph algorithms. 4.  ... 
doi:10.1016/0898-1221(91)90056-a fatcat:orugqwgfgvdd5km6epzzee6urq

Boosting Performance Optimization with Interactive Data Movement Visualization [article]

Philipp Schaad and Tal Ben-Nun and Torsten Hoefler
2022 arXiv   pre-print
We propose an approach that combines static dataflow analysis with parameterized program simulations to analyze both global data movement and fine-grained data access and reuse behavior, and visualize  ...  Performance visualizations can assist in the diagnosis of performance problems, but generally rely on data gathered through lengthy program executions.  ...  The authors also wish to acknowledge the Swiss National Supercomputing Centre (CSCS) for access and support of the computational resources.  ... 
arXiv:2207.07433v1 fatcat:4qtwhdkyszci3kaxqqcwweowea

Taking Advantage of Hybrid Systems for Sparse Direct Solvers via Task-Based Runtimes

Xavier Lacoste, Mathieu Faverge, George Bosilca, Pierre Ramet, Samuel Thibault
2014 2014 IEEE International Parallel & Distributed Processing Symposium Workshops  
The ongoing hardware evolution exhibits an escalation in the number, as well as in the heterogeneity, of computing resources.  ...  Furthermore, they are able to significantly speed up the solver on heterogeneous environments by taking advantage of the accelerators while hiding the complexity of their efficient manipulation from the  ...  ACKNOWLEDGMENT The work presented in this paper is supported by the Inria Associated Team MORSE, by the National Science Foundation under Grant Number CCF-1244905, and by the ANR ANEMOS ANR-11-MONU-002  ... 
doi:10.1109/ipdpsw.2014.9 dblp:conf/ipps/LacosteFBRT14 fatcat:b6yqhke4srhhbhkhxjifof3aae

Taking advantage of hybrid systems for sparse direct solvers via task-based runtimes [article]

Xavier Lacoste, Mathieu Faverge (INRIA Bordeaux - Sud-Ouest, LaBRI), George Bosilca, Pierre Ramet (INRIA Bordeaux - Sud-Ouest, LaBRI), Samuel Thibault (LaBRI, INRIA Bordeaux - Sud-Ouest)
2014 arXiv   pre-print
The ongoing hardware evolution exhibits an escalation in the number, as well as in the heterogeneity, of computing resources.  ...  Furthermore, they are able to significantly speed up the solver on heterogeneous environments by taking advantage of the accelerators while hiding the complexity of their efficient manipulation from the  ...  ACKNOWLEDGMENT The work presented in this paper is supported by the Inria Associated Team MORSE, by the National Science Foundation under Grant Number CCF-1244905, and by the ANR ANEMOS ANR-11-MONU-002  ... 
arXiv:1405.2636v1 fatcat:u7fvjti4hbb45hpn6vcodkzoqm

Students' Mathematical Reasoning, Communication, and Language Representations: A Video-Narrative Analysis

Louise C. Wilkinson, Alison L. Bailey, Carolyn A. Maher
2018 ECNU Review of Education  
These methods include video-narrative analyses that display fine-grained examinations of interactions among students who are solving engaging problems that require them to reason mathematically and to  ...  Design/Approach/Methods-Our approach includes the following aspects: First, we describe a unique collection of video-taped recordings of longitudinal and cross-sectional studies of diverse, U.S. students  ...  The analytic reveals how Ariel first approaches the problem using an arithmetically proportional approach to build a recursive composite function that depends on whether the numbers of rods are even or  ... 
doi:10.30926/ecnuroe2018010301 fatcat:chiodlqronfn5p6sjffi4nmyba

Exposing Fine-Grained Parallelism in Algebraic Multigrid Methods

Nathan Bell, Steven Dalton, Luke N. Olson
2012 SIAM Journal on Scientific Computing  
In this paper, we develop a parallel algebraic multigrid method which exposes substantial fine-grained parallelism in both the construction of the multigrid hierarchy as well as the cycling or solve stage  ...  The resulting solver achieves an average speedup of over 2× in the setup phase and around 6× in the cycling phase when compared to a representative CPU implementation.  ...  One reason for this increase in utility is the trend toward more algebraic approaches.  ... 
doi:10.1137/110838844 fatcat:527xykkeszgsdorpiiiz3l2juq

Coarse Graining the Dynamics of Coupled Oscillators

Sung Joon Moon, R. Ghanem, I. G. Kevrekidis
2006 Physical Review Letters  
We present an equation-free computational approach to the study of the coarse-grained dynamics of finite assemblies of non-identical coupled oscillators at and near full synchronization.  ...  Exploiting short bursts of appropriately initialized detailed simulations, we circumvent the derivation of closures for the long-term dynamics of the assembly statistics.  ...  We present a computer-assisted approach to modeling the coarse-grained dynamics of such large, finite oscillator assemblies at and near full synchronization.  ... 
doi:10.1103/physrevlett.96.144101 pmid:16712078 fatcat:ok6syyggqjck7aenqzdhiljcpe

Solving Acoustic Boundary Integral Equations Using High Performance Tile Low-Rank LU Factorization [chapter]

Noha Al-Harthi, Rabab Alomairy, Kadir Akbudak, Rui Chen, Hatem Ltaief, Hakan Bagci, David Keyes
2020 Lecture Notes in Computer Science  
We taskify the underlying boundary integral kernels to expose fine-grained computations.  ...  the complexity of "classical" dense direct solvers from cubic to quadratic order.  ...  For computer time, this research used the resources from KAUST Supercomputing Laboratory and the University of Bristol for Shaheen-2 and Isambard core hours allocation, respectively.  ... 
doi:10.1007/978-3-030-50743-5_11 fatcat:wdoaeu23pfcjjig7b534hl27xq
« Previous Showing results 1 — 15 out of 3,399 results