To advance the Web of Linked Data, mapping ambiguous names in structured and unstructured contents onto knowledge bases would be a vital asset. State-of-the-art methods for Named Entity Disambiguation (NED) face major tradeoffs regarding efficiency/scalability vs. accuracy. Fast methods use relatively simple context features and avoid computationally expensive algorithms for joint inference. Wh...

Discrete functional limit theorems, which give independent process approximations for the joint distribution of the component structure of combinatorial objects such as permutations and mappings, have recently become available. In this article, we demonstrate the power of these theorems to provide elementary proofs of a variety of new and old limit theorems, including results previously proved ...

Ambient PM2.5 exerts strong regional pattern for its ability long-range transport, implying that including the features of surrounding stations may improve accuracy machine-learning based model to estimate surface from satellite-retrieved aerosol optical depth (AOD). However, most current models either just use single point features, or simply average observed adjacent on a fixed spatial propor...

in this work‎, ‎we formulate chatterjea contractions using graphs in metric spaces endowed with a graph ‎‎and‏ ‎‎‎‎investigate ‎the ‎existence‎ ‎of ‎fixed ‎points ‎for such mappings ‎under two different hypotheses‎. we also discuss the uniqueness of the fixed point. the given result is a generalization of chatterjea's fixed point theorem from metric spaces to metric spaces endowed with a graph.

in this work‎, ‎we formulate chatterjea contractions using graphs in metric spaces endowed with a graph ‎‎and‏ ‎‎‎‎investigate ‎the ‎existence‎ ‎of ‎fixed ‎points ‎for such mappings ‎under two different hypotheses‎. we also discuss the uniqueness of the fixed point. the given result is a generalization of chatterjea's fixed point theorem from metric spaces to metric spaces endowed with a g...