335 Hits in 5.5 sec

Confluence in Data Reduction: Bridging Graph Transformation and Kernelization [chapter]

Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier, Olga Runge
2012 Lecture Notes in Computer Science  
So far, there was little study in the literature concerning the mutual interaction of data reduction rules, in particular whether data reduction rules for a specific problem always lead to the same reduced  ...  Typically, problem kernels are achieved by performing efficient data reduction rules.  ...  Data reduction rules for kernelization for graph problems define graph transformation systems based on undirected graphs, such that the general concepts of (local) confluence and termination are applicable  ... 
doi:10.1007/978-3-642-30870-3_19 fatcat:ev2or6yig5bmfm2gs35tilhpde

Towards a GPU-based implementation of interaction nets

Eugen Jiresch
2014 Electronic Proceedings in Theoretical Computer Science  
We discuss advantages and challenges of the ongoing implementation of ingpu and compare its performance to existing interaction nets evaluators.  ...  A function (the kernel) is executed on the GPU in parallel on each individual data set. Finally, the array of results is copied back to main memory.  ...  kernel instances to read and write shared values.  ... 
doi:10.4204/eptcs.143.4 fatcat:kustmudsmfhjdagquxo5yon3zi

The BigBrainWarp toolbox for integration of BigBrain 3D histology with multimodal neuroimaging

Casey Paquola, Jessica Royer, Lindsay B Lewis, Claude Lepage, Tristan Glatard, Konrad Wagstyl, Jordan DeKraker, Paule-Joanne Toussaint, Sofie Louise Valk, D Louis Collins, Ali Khan, Katrin Amunts (+3 others)
2021 eLife  
This is accomplished with a simple wrapper function that allows users to easily map data between BigBrain and standard MRI spaces.  ...  The function automatically pulls specialised transformation procedures, based on ongoing research from a wide collaborative network of researchers.  ...  Ali Khan acknowledges research support from CIHR Project Grant #366062, NSERC Discovery Grant #6639, and the Canada First Research Excellence Fund.  ... 
doi:10.7554/elife.70119 pmid:34431476 pmcid:PMC8445620 fatcat:hdw4lzyayjcvfnp6ayx6plpkca

Computing Graph Neural Networks: A Survey from Algorithms to Accelerators [article]

Sergi Abadal, Akshay Jain, Robert Guirado, Jorge López-Alonso, Eduard Alarcón
2021 arXiv   pre-print
Graph Neural Networks (GNNs) have exploded onto the machine learning scene in recent years owing to their capability to model and learn from graph-structured data.  ...  Besides of their novelty, GNNs are hard to compute due to their dependence on the input graph, their combination of dense and very sparse operations, or the need to scale to huge graphs in some applications  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers and the editorial team for their constructive criticism, which has helped improve the quality of the paper.  ... 
arXiv:2010.00130v3 fatcat:u5bcmjodcfdh7pew4nssjemdba

Optimising finite-difference methods for PDEs through parameterised time-tiling in Devito [article]

Nicholas Sim
2018 arXiv   pre-print
In this work, we implement time-tiling, a loop nest optimisation, in Devito yielding a decrease in runtime of up to 45%, and at least 20% across stencils from the acoustic wave equation family, widely  ...  We present an estimator for arithmetic intensity under time-tiling and a model to predict runtime improvements in stencil computations.  ...  In the graphs later in this chapter, an overestimate results in a right shift of a data point from its true location.  ... 
arXiv:1806.08299v1 fatcat:b2l72wovkrcqngr7pf27vixram

Data Provenance

Peter Buneman, Wang-Chiew Tan
2019 SIGMOD record  
In this paper, we establish conditions under which a commonly used sufficient condition for invariant confluence is both necessary and sufficient, and we use this condition to design a general-purpose  ...  We then take a step beyond invariant confluence and introduce a generalization of invariant confluence, called segmented invariant confluence, that allows us to replicate non-invariant confluent objects  ...  This work was supported in part by a Hellman Fellowship and by the NIDDK of the NIH under award number R01DK114945.  ... 
doi:10.1145/3316416.3316418 fatcat:u4lmbha4fjgajlc46r66ryh7vi

P-Ray: A Software Suite for Multi-core Architecture Characterization [chapter]

Alexandre X. Duchateau, Albert Sidelnik, María Jesús Garzarán, David Padua
2008 Lecture Notes in Computer Science  
Efficient and correct usage of the various memories is essential, making a difference of 2-17x in performance.  ...  Currently, the task of determining the appropriate memory to use and the coding of data transfer between memories is still left to the programmer.  ...  Chen Ding suggested the lock switching scheme in the memory controller component; Brian Meeker collected some preliminary data in the early stage of this research.  ... 
doi:10.1007/978-3-540-89740-8_13 fatcat:hv2aoouhcve4xc2vlff77k7q4i

Reference list of indexed articles

1995 Theoretical Computer Science  
Rauch and S. Suri, Data structures for two-edge connectivity in planar graphs 130 (1) (1994) 1399161 473. M.M. Halldorsson and M.  ...  Ehrig and M. Lowe, The ESPRIT Basic Research Working Group COMPUGRAPJJ "Computing by Graph Transformation": a survey 109 (l-2) (1993) 3-6 126. A. Corradini and F.  ... 
doi:10.1016/0304-3975(95)90002-0 fatcat:b7nmywx4tff6lhcd3jkoagotrm

Computational Nature of Gene Assembly in Ciliates [chapter]

Robert Brijder, Mark Daley, Tero Harju, Nataša Jonoska, Ion Petre, Grzegorz Rozenberg
2012 Handbook of Natural Computing  
NJ has been supported in part by the NSF grants CCF 0523928 and CCF 0726396.  ...  Acknowledgments MD and GR acknowledge support by NSF, grant 0622112. IP acknowledges support by Academy of Finland, grants 108421 and 203667.  ...  Let us call these graphs abstract reduction graphs, and let the set of abstract reduction graphs be ARG. It turns out that there are graphs in ARG that are not (isomorphic to) reduction graphs.  ... 
doi:10.1007/978-3-540-92910-9_37 fatcat:tkdssq4turhkxcfuq27s5slkiy

Polarities & Focussing: a journey from Realisability to Automated Reasoning [article]

Stéphane Graham-Lengrand
2014 arXiv   pre-print
This idea is pushed further in the second part of this dissertation, and connected to realisability semantics, where the structured data is interpreted algebraically, and the consumption of such data is  ...  This dissertation explores the roles of polarities and focussing in various aspects of Computational Logic.  ...  In the third part of the thesis we explored a specific approach to theorem proving benefitting from the use of polarities and focussing.  ... 
arXiv:1412.6781v1 fatcat:sj4zl2ayu5bzfjaq76znvllsb4

Active Networking: One View of the Past, Present, and Future

J.M. Smith, S.M. Nettles
2004 IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)  
There has been a persistent confluence among operating systems, programming languages, networking and distributed systems.  ...  There has been a persistent confluence among operating systems, programming languages, networking and distributed systems.  ...  The -Kernel composed a protocol graph of protocol components together into a system.  ... 
doi:10.1109/tsmcc.2003.818493 fatcat:lslthszpljcwrnkgrwncmqsj7q

On deformation types of real elliptic surfaces

Alex Degtyarev, Ilia Itenberg, Viatcheslav Kharlamov
2008 American Journal of Mathematics  
As a consequence, we obtain an explicit description of the deformation classes of M- and (M-1)- (i.e., maximal and submaximal in the sense of the Smith inequality) curves and surfaces.  ...  We study real elliptic surfaces and trigonal curves (over a base of an arbitrary genus) and their equivariant deformations.  ...  If k = 2, the reduction to Case 0 is obtained by creating a solid bridge as in Figure 12 (if v 2 is monochrome) or by creating a bold bridge as in Figures 13 and 14 ( if v 2 is a •-vertex and the bold  ... 
doi:10.1353/ajm.0.0029 fatcat:m7erxwxwwncrzjbwrygf3muboa

Classification of Base Station Time Series Based on Weighted Adjustable-Parameter LPVG

Luqi Li, Hao Jiang, He Nai
2019 2019 IEEE 5th Intl Conference on Big Data Security on Cloud (BigDataSecurity), IEEE Intl Conference on High Performance and Smart Computing, (HPSC) and IEEE Intl Conference on Intelligent Data and Security (IDS)  
However, the continuous growth of spatial data has created considerable challenges in big data processing.  ...  Two experiments and comparative analyses with existing methods are presented in Section 4. Conclusions and suggestions are discussed in Section 5.  ...  Acknowledgments: The authors would like to thank OpenITS for their initiatives in intelligent transport system. Meanwhile, we thank the editors and reviewers for their valuable comments.  ... 
doi:10.1109/bigdatasecurity-hpsc-ids.2019.00032 fatcat:a7ko2gty7jcpzbrmntxa4sl2sm

Reference list of indexed articles

1995 Theoretical Computer Science  
Rauch and S. Surt. Data structures for two-edge connectivity in planar graphs 130(l) (1994) 139 161 473. M.M. Halldorsson and M. Sregedy.  ...  Bridges and C. C'alude. On recursive bounds for the exceptional values in speed-up (12;. Berstel and M. Pocchiola.  ... 
doi:10.1016/0304-3975(95)80003-4 fatcat:5nnk76aalje5potfoeg7hksbce

The Incremental Multiresolution Matrix Factorization Algorithm [article]

Vamsi K. Ithapu, Risi Kondor, Sterling C. Johnson, Vikas Singh
2017 arXiv   pre-print
Multiresolution analysis and matrix factorization are foundational tools in computer vision.  ...  In this work, we study the interface between these two distinct topics and obtain techniques to uncover hierarchical block structure in symmetric matrices -- an important aspect in the success of many  ...  Acknowledgments: The authors are supported by NIH AG021155, EB022883, AG040396, NSF CAREER 1252725, NSF AI117924 and 1320344/1320755.  ... 
arXiv:1705.05804v1 fatcat:fzyw2kndxbdkhnxnyf3s5yoqua
« Previous Showing results 1 — 15 out of 335 results