Titlebook: Web Reasoning and Rule Systems; 8th International Co Roman Kontchakov,Marie-Laure Mugnier Conference proceedings 2014 Springer Internationa

通情達(dá)理

Giuseppe Marra,Antonino Nocera,Francesco Ricca,Giorgio Terracina,Domenico Ursinoed by the opening size, opening direction and the confidence interval of error. Further, the nearest projection points could be found out to constitute the skeleton frame of the ICCP algorithm. Then, the average of the shortest distance between two data sets is calculated by the distance and positio

Fsh238

Matthias Nickles,Alessandra Mileoixing method during the process of endmembers selections. Experimental results suggest that the sparse spectral unmixing algorithm is with apparently better performance when compared to those of linear spectral unmixing algorithm, signified with lower root-mean-square error and higher correlation. T

LAVE

IVORY

Andreas Nolle,Christian Meilicke,Heiner Stuckenschmidt,German Nemirovski graph data construction method is proposed. (2) Propose to incorporate neural transformation learning into the architecture, improve data learning expression ability, and further improve the shortcomings of graph neural classification, enabling it to adapt to the spatiotemporal and multi-dimensiona

CLIFF

Andreas Nolle,Christian Meilicke,Heiner Stuckenschmidt,German Nemirovskiolve the problem. First, general public with weak sense of direction utilize their own position and surrounding spatial objects as a reference to determine map orientation, no longer use a certain direction of the traditional longitude and latitude grid line (i.e. geographic orientation) for orienta