Analyzing Large-Scale Multiuser Molecular Communication via 3-D Stochastic Geometry
نویسندگان
چکیده
منابع مشابه
Large-Scale Hierarchical Classification via Stochastic Perceptron
Hierarchical classification (HC) plays an significant role in machine learning and data mining. However, most of the state-of-the-art HC algorithms suffer from high computational costs. To improve the performance of solving, we propose a stochastic perceptron (SP) algorithm in the large margin framework. In particular, a stochastic choice procedure is devised to decide the direction of next ite...
متن کاملLarge-scale Wireless Networks: Stochastic Geometry and Ordering
Recently, the location of the nodes in wireless networks has been modeled as point processes. In this dissertation, various scenarios of wireless communications in large-scale networks modeled as point processes are considered. The first part of the dissertation considers signal reception and detection problems with symmetric alpha stable noise which is from an interfering network modeled as a ...
متن کاملLarge-Scale Gaussian Process Regression via Doubly Stochastic Gradient Descent
Gaussian process regression (GPR) is a popular tool for nonlinear function approximation. Unfortunately, GPR can be difficult to use in practice due to the O(n) memory and O(n) processing requirements for n training data points. We propose a novel approach to scaling up GPR to handle large datasets using the recent concept of doubly stochastic functional gradients. Our approach relies on the fa...
متن کاملStochastic geometry and architecture of communication networks
This paper proposes a new approach for communication networks planning; this approach is based on stochastic geometry. We rst summarize the state of the art in this domain, together with its economic implications, before sketching the main expectations of the proposed method. The main probabilistic tools are point processes and stochastic geometry. We show how several performance evaluation and...
متن کاملAnalyzing the Stochastic Complexity via Tree Polynomials
Stochastic complexity of a data set is defined as the shortest possible code length for the data obtainable by using some fixed set of models. This measure is of great theoretical and practical importance as a tool for tasks such as model selection and data clustering. Unfortunately straightforward computation of this measure requires exponential time with respect to the size of the data. The p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Molecular, Biological and Multi-Scale Communications
سال: 2017
ISSN: 2372-2061,2332-7804
DOI: 10.1109/tmbmc.2017.2750145