13 papers · ranked by Valyu relevance
Oleksandr Semeniuta, Petter Falkman, Mario Luca Bernardi
Many data processing systems are naturally modeled as pipelines, where data flows though a network of computational procedures. This representation is particularly suitable for computer vision algorithms, which in most cases possess complex logic and a big number of parameters to tune. In addition, online vision…
John M. Myers, Hadi Madjid
The accurate copying of nucleotides in DNA replication is arguably a digital computation. So are some cognitive capacities found in all organisms. In 2005 we proved that linking quantum calculations to evidence requires guesswork subject to revision (Madjid and Myers [9]). Based on this proof, we assume computations by…
Ha-Myung Park, Namyong Park, Sung-Hyon Myaeng, U Kang + 1 more
'Tatsuro Kawamoto'] A connected component in a graph is a set of nodes linked to each other by paths. The problem of finding connected components has been applied to diverse graph analysis tasks such as graph partitioning, graph compression, and pattern recognition. Several distributed algorithms have been proposed to…
Larbi Abdenebaoui, Hans-Jörg Kreowski, Sabine Kuske, Vanneschi Leonardo
'Vanneschi Leonardo'] In this paper, we propose a graph-transformational approach to swarm computation that is flexible enough to cover various existing notions of swarms and swarm computation, and it provides a mathematical basis for the analysis of swarms with respect to their correct behavior and efficiency. A graph…
Amin Sahebi, Marco Barbone, Marco Procaccini, Wayne Luk + 2 more
'Georgi Gaydadjiev' 'Roberto Giorgi'] Processing large-scale graphs is challenging due to the nature of the computation that causes irregular memory access patterns. Managing such irregular accesses may cause significant performance degradation on both CPUs and GPUs. Thus, recent research trends propose graph…
Angelo Furno, Nour-Eddin El Faouzi, Rajesh Sharma, Eugenio Zimeo + 1 more
'Irene Sendiña-Nadal'] Betweenness Centrality (BC) has proven to be a fundamental metric in many domains to identify the components (nodes) of a system modelled as a graph that are mostly traversed by information flows thus being critical to the proper functioning of the system itself. In the transportation domain, the…
Miguel E. Coimbra, Alexandre P. Francisco, Luís Veiga
The value of graph-based big data can be unlocked by exploring the topology and metrics of the networks they represent, and the computational approaches to this exploration take on many forms. For the use-case of performing global computations over a graph, it is first ingested into a graph processing system from one…
Luca Cappelletti, Tommaso Fontana, Elena Casiraghi, Vida Ravanmehr + 7 more
'Tiffany J. Callahan' 'Carlos Cano' 'Marcin P. Joachimiak' 'Christopher J. Mungall' 'Peter N. Robinson' 'Justin Reese' 'Giorgio Valentini'] Graph representation learning methods opened new avenues for addressing complex, real-world problems represented by graphs. However, many graphs used in these applications comprise…
Hector Zenil, Narsis A. Kiani, Jesper Tegnér
The principle of maximum entropy (Maxent) is often used to obtain prior probability distributions as a method to obtain a Gibbs measure under some restriction giving the probability that a system will be in a certain state compared to the rest of the elements in the distribution. Because classical entropy-based Maxent…
Amirmohammad Farzaneh, Justin P. Coon, Mihai-Alin Badiu, Narsis A. Kiani + 2 more
'Narsis A. Kiani' 'Hector Zenil' 'Jesper Tegnér'] Throughout the years, measuring the complexity of networks and graphs has been of great interest to scientists. The Kolmogorov complexity is known as one of the most important tools to measure the complexity of an object. We formalized a method to calculate an upper…
Tatsuya Akutsu, Hiroshi Nagamochi
Chemical compounds are usually represented as graph structured data in computers. In this review article, we overview several graph classes relevant to chemical compounds and the computational complexities of several fundamental problems for these graph classes. In particular, we consider the following problems…
Benjamin Schiller, Clemens Deusser, Jeronimo Castrillon, Thorsten Strufe
'Thorsten Strufe'] Graphs are used to model a wide range of systems from different disciplines including social network analysis, biology, and big data processing. When analyzing these constantly changing dynamic graphs at a high frequency, performance is the main concern. Depending on the graph size and structure…
Yaohua Lu, Gangyi Ding, Kaizhi Huang, Guan-Jie Fan-Yuan + 1 more
'Hua-Lei Yin'] Quantum secure multi-party summation (QSMS) is a fundamental problem in quantum secure multi-party computation (QSMC), wherein multiple parties compute the sum of their data without revealing them. This paper proposes a novel QSMS protocol based on graph state, which offers enhanced security, usability…