All Stories

  1. Jay: A software framework for prototyping and evaluating offloading applications in hybrid edge clouds
  2. A Survey on Subgraph Counting
  3. Novel features for time series analysis: a complex networks approach
  4. Network Science
  5. Energy-aware adaptive offloading of soft real-time jobs in mobile edge clouds
  6. Time series analysis via network science: Concepts and algorithms
  7. Jay: Adaptive Computation Offloading for Hybrid Cloud Environments
  8. FOCAS
  9. Iris: Secure reliable live-streaming with opportunistic mobile edge cloud offloading
  10. Finding Dominant Nodes Using Graphlets
  11. Feature-enriched author ranking in incomplete networks
  12. Temporal network alignment via GoT-WAVE
  13. OTARIOS: OpTimizing Author Ranking with Insiders/Outsiders Subnetworks
  14. Graphlet-orbit Transitions (GoT): A fingerprint for temporal network comparison
  15. Hierarchical Expert Profiling Using Heterogeneous Information Networks
  16. Video Dissemination in Untethered Edge-Clouds: A Case Study
  17. Extending the Applicability of Graphlets to Directed Networks
  18. Using Edge-Clouds to Reduce Load on Traditional WiFi Infrastructures and Improve Quality of Experience
  19. Evolutionary role mining in complex networks by ensemble clustering
  20. Feature extraction for the author name disambiguation problem in a bibliographic database
  21. Parallel Asynchronous Strategies for the Execution of Feature Selection Algorithms
  22. P3-Mobile
  23. Towards a middleware for mobile edge-cloud applications
  24. A Subgraph-Based Ranking System for Professional Tennis Players
  25. Benchmarking Wireless Protocols for Feasibility in Supporting Crowdsourced Mobile Computing
  26. A Parallel Computing Hybrid Approach for Feature Selection
  27. Special Issue: Euro-Par 2014
  28. Pairwise structural role mining for user categorization in information cascades
  29. Discovering weighted motifs in gene co-expression networks
  30. Dynamic inference of social roles in information cascades
  31. Parallel Subgraph Counting for Multicore Architectures
  32. Discovering Colored Network Motifs
  33. Euro-Par 2014 Parallel Processing
  34. Querying Volatile and Dynamic Networks
  35. G-Tries: a data structure for storing and finding subgraphs
  36. Stheno, a real-time fault-tolerant P2P middleware platform for light-train systems
  37. Motif Mining in Weighted Networks
  38. Event detection in evolving networks
  39. Comparison of Co-authorship Networks across Scientific Fields Using Motifs
  40. Scheduling OR-parallelism in YapOr and ThOr on Multi-Core Machines
  41. Parallel discovery of network motifs
  42. Or-parallel prolog execution on multicores based on stack splitting
  43. Querying subgraph sets with g-tries
  44. A design and implementation of the Extended Andorra Model
  45. A Parallel Algorithm for Counting Subgraphs in Complex Networks
  46. Network Node Label Acquisition and Tracking
  47. Lightweight Fault-Tolerance for Peer-to-Peer Middleware
  48. Efficient Parallel Subgraph Counting Using G-Tries
  49. Efficient Subgraph Frequency Estimation with G-Tries
  50. g-tries
  51. Strategies for Network Motifs Discovery
  52. Parallel calculation of multi-electrode array correlation networks
  53. Improving the efficiency of inductive logic programming systems
  54. Parallel ILP for distributed-memory architectures
  55. A peer-to-peer middleware platform for fault-tolerant, QoS, real-time computing
  56. April – An Inductive Logic Programming System
  57. A pipelined data-parallel algorithm for ILP
  58. Dynamic Mixed-Strategy Evaluation of Tabled Logic Programs
  59. IMPACT: Innovative Models for Prolog with Advanced Control and Tabling
  60. On applying or-parallelism and tabling to logic programs
  61. Strategies to Parallelize ILP Systems
  62. Topic 9 Parallel Programming: Models, Methods and Languages
  63. Concurrent Table Accesses in Parallel Tabled Logic Programs
  64. On Avoiding Redundancy in Inductive Logic Programming
  65. Pruning in the Extended Andorra Model
  66. Speculative Computations in Or-Parallel Tabled Logic Programs
  67. A Multi-threaded Asynchronous Language
  68. Efficient Data Structures for Inductive Logic Programming
  69. Experimental Evaluation of a Caching Technique for ILP
  70. Mob: A Scripting Language for Mobile Agents Based on a Process Calculus
  71. Mooshak: a Web-based multi-site programming contest system
  72. On Deterministic Computations in the Extended Andorra Model
  73. On the BEAM Implementation
  74. YapDss: An Or-Parallel Prolog System for Scalable Beowulf Clusters
  75. Achieving scalability in parallel tabled logic programs
  76. P3: Parallel Peer to Peer An Internet Parallel Programming Environment
  77. Fine-grained multithreading with process calculi
  78. A Novel Implementation of the Extended Andorra Model
  79. On a Tabling Engine That Can Exploit Or-Parallelism
  80. Parallel Implementation of Decision Tree Learning Algorithms
  81. Or-parallel Prolog on a distributed memory architecture
  82. A concurrent programming environment with support for distributed computations and code mobility
  83. Novel Models for Or-Parallel Logic Programs: A Performance Analysis
  84. A Virtual Machine for a Process Calculus
  85. DAOS — Scalable And-Or Parallelism
  86. di_pSystem: A Parallel Programming System for Distributed Memory Architectures
  87. YapOr: An Or-Parallel Prolog System Based on Environment Copying
  88. Or-Parallelism within Tabling
  89. Distribution and Mobility with Lexical Scoping in Process Calculi
  90. Thread- and Process-based Implementations of the pSystem Parallel Programming Environment
  91. Performance of Sparse Binding Arrays for Or-Parallelism
  92. Aurora vs. Muse: a portability study of two or-parallel Prolog systems
  93. Scheduling algorithms performance with the pSystem parallel programming environment
  94. An or-parallel prolog execution model for a distributed shared memory machine
  95. BIORED - A Genetic Algorithm for Pattern Detection in Biosequences
  96. Fine grained multithreading with process calculi
  97. Preface