搜索结果: 1-15 共查到“数学 communication”相关记录21条 . 查询时间(0.054 秒)
德国柏林工业大学Martin Grotschel教授座客冯康公众演讲讲授“Mathematics of Communication”
Martin Grotschel Mathematics of Communication 德国柏林工业大学
2014/10/24
德国柏林工业大学教授、Konrad-Zuse-Zentrum研究所所长、国际数学联合会秘书长 Martin Grötschel 教授受中国科学院科学与工程计算国家重点实验室邀请，于10月20日在中科院数学院南楼204会议室作了题为“Mathematics of Communication”的公众演讲。他是在冯康公众演讲座客的第六位专家。来自数学院内及外单位的专家、学者和研究生80余人出席...
Randomized Communication Complexity for Linear Algebra Problems over Finite Fields
communication complexity streaming, matrix singularity determinant
2012/12/3
Finding the singularity of a matrix is a basic problem in linear algebra. Chu and Schnitger first considered this problem in the communication complexity model, in which Alice holds the first half of ...
Connectivity statistics of store-and-forward inter-vehicle communication
Connectivity statistics store-and-forward inter-vehicle communication
2010/12/28
Inter-vehicle communication (IVC) enables vehicles to exchange messages within a limited broadcast range and thus self-organize into dynamical vehicular ad hoc networks. For
the foreseeable future, h...
Universal Communication over Modulo-additive Channels with an Individual Noise Sequence
Universal Communication Modulo-additive Channels Individual Noise Sequence
2011/1/21
Which communication rates can be attained over an unknown channel where the relation between the input and output can be arbitrary? A channel where the output is any arbitrary (possibly stochastic) fu...
Belief-propagation-based joint channel estimation and decoding for spectrally efficient communication over unknown sparse channels
belief propagation message passing compressive sensing compressed sensing
2011/2/24
We consider spectrally-efficient communication over a Rayleigh N-block-fading channel with a K-
sparse L-length discrete-time impulse response (for 0ither the transmitter nor
receiv...
Spectrum is the most valuable resource in the communication system, but unfor-tunately, so far, a half of the spectrum has been wasted, that is negative frequency spectrum.
Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic
Max-Flow Min-Cut Theorems Communication Networks Equational Logic
2011/2/25
Traditionally, communication networks are modeled and analyzed in terms of information flows in
graphs. In this paper, we introduce a new symbolic approach to communication networks, where the topolo...
Molecular communication in fluid media: The additive inverse Gaussian noise channel
Molecular communication fluid media additive inverse Gaussian noise channel
2011/1/17
We consider molecular communication, with information conveyed in the time of release of molecules.The main contribution of this paper is the development of a theoretical foundation for such a communi...
Secure Wireless Communication and Optimal Power Control under Statistical Queueing Constraints
Secure Wireless Communication Optimal Power Control Statistical Queueing Constraints
2011/1/14
In this paper, secure transmission of information over fading broadcast channels is studied in the presence of statistical queueing constraints. Effective capacity is employed as a performancemetric t...
Secure Communication over Parallel Relay Channel
Secure Communication Parallel Relay Channel
2010/11/15
We investigate the problem of secure communication over the parallel relay channel in the presence of a passive eavesdropper. We consider a four terminal relay-eavesdropper channel which consists of m...
Minimizing Communication for Eigenproblems and the Singular Value Decomposition
Minimizing Communication Eigenproblems the Singular Value Decomposition
2010/11/19
Algorithms have two costs: arithmetic and communication. The latter represents the cost of moving data, either between levels of a memory hierarchy, or between processors over a network. Communicatio...
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
Optimal Lower Bound Communication Complexity Gap-Hamming-Distance
2010/12/15
We prove an optimal W(n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal multi-pass space lower...
Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
asymptotic rates of zero-error classical classical channels
2010/12/15
It is known that the number of di erent classical messages which can be communicated
with a single use of a classical channel with zero probability of decoding error can sometimes
be increased by us...
Quantum One-Way Communication is Exponentially Stronger Than Classical Communication
Quantum One-Way Communication Classical Communication
2010/12/15
In STOC 1999, Raz presented a (partial) function for which there is a quantum protocol communicating only O(log n) qubits, but for which any classical (randomized, bounded-error)
protocol requires po...
Information-Theoretic Analysis of an Energy Harvesting Communication System
Information-Theoretic Analysis Energy Harvesting Communication System
2010/12/14
In energy harvesting communication systems, an exogenous recharge process supplies energy for the data transmission and arriving energy can be buffered in a battery before consumption.