【摘 要】
：
To prove or disprove an information inequality is a crucial step in the coding theorems of networks.When networks scale up,this is a computationally difficu
【机 构】
：
City Univ.of Hong Kong
论文部分内容阅读
To prove or disprove an information inequality is a crucial step in the coding theorems of networks.When networks scale up,this is a computationally difficult task.
其他文献
In this talk,I will present a method to certify and compute numerically the simple zeros of an over-determined polynomial system.
In this talk,we introduce integral-differential algebras.By using the method of Grobner-Shirshov bases,we give the constructions of free commutative integro
Given two points in a real algebraic set,the motion planning problem consists in building a continuous path connecting them,if possible.
For a given real polynomial f and two or more given zeros,we consider a problem of describing the distance between f and the nearest polynomial(f)to f havin
For systems of differential equations,one often investigates stability.The center-focus problem aims to compute conditions on the parameters to distinguish
There is considerable literature for effectively computing the Smith decomposition of a univariate polynomial matrix.
We propose EXTRA,an EXact firsT-oRder Algorithm to solve the decentralized consensus optimization problem where a network of agents collaboratively find the
We consider a wireless cloud radio access network(C-RAN)in which the base-stations are connected to a central computing cloud with highcapacity backhaul lin
The alternating direction method of multipliers(ADMM)is a very popular algorithm for solving large-scale optimization problems,convex or nonconvex,in many e
In recent years,there has been an increasing merge of sparse optimization,signal processing,wireless communications,information theory,machine learning,data