We analyze the difficulties of defining temporal graph traversals and propose new definitions of DFS and BFS for a temporal graph. We investigate the properties of temporal DFS and BFS, and propose efficient algorithms with optimal complexity. In particular, we also study important applications of ...
This article offers a comprehensive overview of Business Sustainability (BuS), and directly addresses the lack of consensus around this important concept. Through a mixed-methods approach, we conduct the first systematic literature review of BuS employing Latent Dirichlet Allocation (LDA) topic modeling...
We are particularly interested in results in the off-line domain, as most large systems have a large amount of logs, but little to no tolerance for exploratory actions (datacenter cooling and robotics being good examples of this). We also believe that algorithms able to reason about ...
Computer Science - Data Structures and AlgorithmsPhysics - Physics and SocietyWe introduce and formulate two types of random-walk domination problems in graphs motivated by a number of applications in practice (e.g., item-placement problem in online social network, Ads-placement problem in ...
V.I. Arnautov The exterior stability number of a graph Diskret. Analiz, 20 (1972), pp. 3-8 Google Scholar Arnborg, 1985 S. Arnborg Efficient algorithms for combinatorial problems on graphs with bounded decomposability — a survey BIT, 25 (1985), pp. 2-23 Google Scholar Arnborg and Pro...
algorithms relies on the selected features which could be not the right ones to be discriminated between classes [1]. In particular, DL is a good approach to eliminate the long process of ML algorithms and follow a more automated manner. Figure1shows the difference between both DL and ML ...
Every other code metrics, lines of code, complexity, code coverage, coupling ... can be harnessed through code rules with thresholds. The rules creates issues upon code metrics thresholds violations. And for each issue, we can estimate thecost to fixin terms ofperson-time. ...
Multiplication of functions If f1(x) is O(g1(x)) and f2(x) is O(g2(x)), then(f1f2)(x) is O(g1(x)g2(x)) Tractable A problem that is solvable using analgorithm with "reasonable" (low order polynomial)worst-case complexity Intractable A problem that cannot be solved using analg...
Table 3.1 Definitions of big data Full size table Big data brings together a set of data management challenges for working with data under new scales of size and complexity. Many of these challenges are not new. What is new however are the challenges raised by the specific characteristics of ...
d Michele Lupattellib and Malgorzata Worekb aMTA-DE Particle Physics Research Group, University of Debrecen, H-4010 Debrecen, PBox 105, Hungary bInstitute for Theoretical Particle Physics and Cosmology, RWTH Aachen University, D-52056 Aachen, Germany cCavendish Laboratory, University of Cambridge,...