A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
We consider graph-controlled insertion-deletion systems and prove that the systems with sizes (i) (, 0) and (iii) (2; 2, 0, 0; 1, 1, 1) are computationally complete. ...
The parameters in the size (k; n, i , i ; m, j , j ) of a graph-controlled insertion-deletion system denote (from left to right) the maximum number of components, the maximal length of the insertion string ...
Acknowledgement The second author would like to acknowledge the project SR/S3/EECE/054/2010, Department of Science and Technology, New Delhi, India. ...
doi:10.1007/978-3-319-41114-9_9
fatcat:fsdkgsdqzffrdpbpyt7ketfcmi
Investigations on Natural Computing in the Institute of Mathematics and Computer Science
2010
Computer Science Journal of Moldova
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We describe the investigations on natural computing in the Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova during last fifteen years. ...
Most of these investigations are inspired by results and ideas belonging to Corresponding Member of the Romanian Academy Gheorghe Paun. ...
Acknowledgments All authors acknowledge the support by the Science and Technology Center in Ukraine, project 4032. ...
doaj:4a41c2dcf8c14619bd127cda0ee90e72
fatcat:oytiwwjjlzdabc7om5h7mkatla
Multiscale Network Generation
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Statistical analyses of networks can provide critical insights into the structure, function, dynamics, and evolution of those systems. ...
generation algorithms. ...
A scale-free graph [3] with n and m adjusted to match the size and density of the original network.
4. ...
arXiv:1207.4266v1
fatcat:rqkspx7crvfazis6k3jhm2mcem
Technical Report: Accelerating Dynamic Graph Analytics on GPUs
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Our extensive experiments with three streaming applications on large-scale real and synthetic datasets demonstrate the superior performance of our proposed approach. ...
Hence, rebuilding the graphs becomes the bottleneck of processing high-speed graph streams. ...
The success of deploying specific graph algorithms on GPUs motivates the design of general GPU graph processing systems like Medusa [57] and Gunrock [48] . ...
arXiv:1709.05061v2
fatcat:5aorda4j2bbopigdvu4mpnczqi
Accelerating dynamic graph analytics on GPUs
2017
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Our extensive experiments with three streaming applications on large-scale real and synthetic datasets demonstrate the superior performance of our proposed approach. ...
Hence, rebuilding the graphs becomes the bottleneck of processing high-speed graph streams. ...
The success of deploying specific graph algorithms on GPUs motivates the design of general GPU graph processing systems like Medusa [58] and Gunrock [50] . ...
doi:10.14778/3151113.3151122
fatcat:zjyzodyd2vczjakz77ecdro6km
Query processing in main memory database management systems
1986
SIGMOD record
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
One approach to achieving high performance in a database management system is to store the database in main memorv rather than on disk. ...
In this paper we present some results on index structures from an ongoing study of main memory database management systems. ...
The query mix of 60 percent searches, 20 percent inserts and 20 percent deletes was representative of the three query mix graphs, so it is the only one shown; index structures with faster search times ...
doi:10.1145/16856.16878
fatcat:aqhczp6glndhhljqxh3jgl4wsq
A new parallel algorithm for connected components in dynamic graphs
2013
20th Annual International Conference on High Performance Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Statically computing analytics on snapshots of these dynamic graphs is frequently not fast enough to provide current and accurate information as the graph changes. ...
On a graph with 512 million edges, we show that our new dynamic algorithm is up to 128X faster than well-known static algorithms and that our algorithm achieves a 14X parallel speedup on a x86 64-core ...
The content of the information in this document does not necessarily reflect the position or the policy of the Government, and no official endorsement should be inferred. The U.S. ...
doi:10.1109/hipc.2013.6799108
dblp:conf/hipc/McCollGB13
fatcat:2n7xpgvhvnd5vcgy7dya4cxinq
Guaranteeing 2-manifold property for meshes
1999
Proceedings Shape Modeling International '99. International Conference on Shape Modeling and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our solution is based on graph rotation systems developed in topological graph theory. As an internal representation of meshes, we use Doubly Linked Face List (DLFL). ...
We have also developed a visual representation of the topology that provides a powerful tool for developing a user interface to manipulate the topology of the mesh. ...
We combine the graph rotation system representation and the polygonal representation into one integrated system, in which the graph rotation system is used as an internal representation for manifolds, ...
doi:10.1109/sma.1999.749318
dblp:conf/smi/AklemanC99
fatcat:67zsqti5uzbtfa3nolnqeykhoe
On the edge insertion/deletion and controllability distance of linear structural systems
2017
2017 IEEE 56th Annual Conference on Decision and Control (CDC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2018 pre-print arXiv:1803.07928v2 fatcat:suydp3jxanazlgk4lylk6fouqiOther Versions
This paper is related to the computation complexity of minimal (cost) link insertion, deletion and vertex deletion with respect to structural controllability of networks. ...
controllability of the system, even with identical link costs or when the removable links are restricted in input links. ...
Such property gives us much convenience to study the influence of link insertion/deletion or actuator deletion on controllability of networks. ...
doi:10.1109/cdc.2017.8263985
dblp:conf/cdc/ZhangZ17
fatcat:qlm5ueg3qradbkfmhflzy575k4
SIGMA: A SET-COVER-BASED INEXACT GRAPH MATCHING ALGORITHM
2010
Journal of Bioinformatics and Computational Biology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Here we provide a novel graph indexing method to cope with the more general, inexact matching problem. ...
Graph indexing is a powerful method for searching a large database of graphs. ...
RBIN04BYZ7: Algorithms for Patterns Discovery and Retrieval in discrete structures with applications to Bioinformatics. ...
doi:10.1142/s021972001000477x
pmid:20401944
fatcat:aarwuzcybjd3tej3pkq5fpt7zq
P systems with minimal insertion and deletion
2011
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we consider insertion-deletion P systems with priority of deletion over insertion. ...
We show that such systems with one-symbol context-free insertion and deletion rules are able to generate Parikh sets of all recursively enumerable languages (PsRE). ...
The second author acknowledges the support of the PIF program of University Rovira i Virgili, and project no. MTM2007-63422 from the Ministry of Science and Education of Spain. ...
doi:10.1016/j.tcs.2010.08.025
fatcat:pszb7rrrerec7dohmmwdksnsq4
An internet graph model based on trade-off optimization
2004
European Physical Journal B : Condensed Matter Physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose here a generalization of this approach to generate a general graph, as a candidate for modeling the Internet. ...
This paper presents a new model for the Internet graph (AS graph) based on the concept of heuristic trade-off optimization, introduced by Fabrikant, Koutsoupias and Papadimitriou in [5] to grow a random ...
Influence of the size of the graph. Table 1 shows the influence of the size n of the graph on the measured parameters, and compares them to the measured AS and IR graphs. ...
doi:10.1140/epjb/e2004-00116-y
fatcat:fyc5nejtardglphbovvewtly3q
Model-Driven Software Development with Graph Transformations: A Comparative Case Study
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Significant achievements have been made in the design and implementation of languages and tools for graph transformation systems. ...
We compare these approaches with respect to the respective levels of abstraction on which models are defined, the language concepts offered, and the resulting modeling effort. ...
When a control flow is deleted, the same check is invoked on all control flows of all cycles to which the deleted control flow belongs. ...
doi:10.1007/978-3-540-89020-1_24
fatcat:qid656pu3zdy3n55ptxfx4qlc4
Models of Genome Evolution
[chapter]
2004
Natural Computing Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The functions can decide the insertion/deletion positions of the DNA fragments, the copy numbers of the inserted fragments, and the sequences of the inserted/deleted pieces. ...
The power law distribution with its "hubby" topology (e.g., P53 was shown to interact with an unusually large number of other proteins) can be explained if one makes the following assumption: new proteins ...
The frequencies and sizes of the deletions or insertions vary with specific elements. ...
doi:10.1007/978-3-642-18734-6_13
fatcat:yizya4yaijgztbwtn2syhfnwi4
LiveGraph: A Transactional Graph Storage System with Purely Sequential Adjacency List Scans
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The specific characteristics of graph workloads make it hard to design a one-size-fits-all graph storage system. ...
This paper presents LiveGraph, a graph storage system that outperforms both the best graph transactional systems and the best systems for real-time graph analytics on fresh data. ...
Inspired by the buddy system [37] , we consider protocols of fitting each per-vertex edge log into a log block of the closest power-of-2 size. ...
arXiv:1910.05773v1
fatcat:7eluyrrabja5lhrugd32oh5fru
« Previous
Showing results 1 — 15 out of 34,818 results