|
|
|
Philip Dawid
This article surveys the variety of ways in which a directed acyclic graph (DAG) can be used to represent a problem of probabilistic causality. For each of these ways, we describe the relevant formal or informal semantics governing that representation. I...
ver más
|
|
|
|
|
|
|
Charlee Kaewrat, Poonpong Boonbrahm and Bukhoree Sahoh
Unsuitable shoe shapes and sizes are a critical reason for unhealthy feet, may severely contribute to chronic injuries such as foot ulcers in susceptible people (e.g., diabetes patients), and thus need accurate measurements in the manner of expert-based ...
ver más
|
|
|
|
|
|
|
Binbin Shi, Lijuan Zhang, Jie Huang, Huilin Zheng, Jian Wan and Lei Zhang
Text data augmentation is essential in the field of medicine for the tasks of natural language processing (NLP). However, most of the traditional text data augmentation focuses on the English datasets, and there is little research on the Chinese datasets...
ver más
|
|
|
|
|
|
|
Anugrah K. Pamosoaji and Djoko Budiyanto Setyohadi
In this paper, a novel graph model to figure Collision-Free Multiple Traveling Salesman Problem (CFMTSP) is proposed. In this problem, a group of vehicles start from different nodes in an undirected graph and must visit each node in the graph, following ...
ver más
|
|
|
|
|
|
|
Mustafa Hajij and Paul Rosen
The Reeb graph of a scalar function that is defined on a domain gives a topologically meaningful summary of that domain. Reeb graphs have been shown in the past decade to be of great importance in geometric processing, image processing, computer graphics...
ver más
|
|
|
|
|
|
|
Shyr-Long Jeng, Rohit Roy and Wei-Hua Chieng
Mason?s gain formula can grow factorially because of growth in the enumeration of paths in a directed graph. Each of the (n - 2)! permutation of the intermediate vertices includes a path between input and output nodes. This paper presents a novel method ...
ver más
|
|
|
|
|
|
|
Yan Zhou, Xianwei Zheng, Hanjiang Xiong and Ruizhi Chen
|
|
|
|
|
|
|
Peng Mi, Maoyuan Sun, Moeti Masiane, Yong Cao and Chris North
Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. Howe...
ver más
|
|
|
|