|
|
|
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
|
|
|
|
|
|
Petro Lizunov,Andrii Biloshchytskyi,Alexander Kuchansky,Yurii Andrashko,Svitlana Biloshchytska
Pág. 6 - 14
For the problem of formation of project teams, in particular, scientific research project groups, there was proposed the comprehensive method, which consists of the two-stage method for clustering the graph of citation of scientists» publications and the...
ver más
|
|
|
|
|
|
Muhammad Aman, Abas Bin Md Said, Said Jadid Abdul Kadir and Israr Ullah
Automatic key concept extraction from text is the main challenging task in information extraction, information retrieval and digital libraries, ontology learning, and text analysis. The statistical frequency and topical graph-based ranking are the two ki...
ver más
|
|
|
|
|
|
Daniel Haehn, John Hoffer, Brian Matejek, Adi Suissa-Peleg, Ali K. Al-Awami, Lee Kamentsky, Felix Gonda, Eagon Meng, William Zhang, Richard Schalek, Alyssa Wilson, Toufiq Parag, Johanna Beyer, Verena Kaynig, Thouis R. Jones, James Tompkin, Markus Hadwiger, Jeff W. Lichtman and Hanspeter Pfister
Connectomics has recently begun to image brain tissue at nanometer resolution, which produces petabytes of data. This data must be aligned, labeled, proofread, and formed into graphs, and each step of this process requires visualization for human verific...
ver más
|
|
|
|
|
|
Carmen Brando,Francesca Frontini,Jean-Gabriel Ganascia
Pág. 60 - 80
This paper proposes a graph-based Named Entity Linking (NEL) algorithm named REDEN for the disambiguation of authors? names in French literary criticism texts and scientific essays from the 19th and early 20th centuries. The algorithm is described and ev...
ver más
|
|
|