113
click to vote
CORR
2016
Springer
10 years 1 months ago
2016
Springer
We consider the problem of computing the monic gcd of two polynomials over a number field L = Q(α1, . . . , αn). Langemyr and McCallum have already shown how Brown’s modular ...
120
click to vote
CORR
2016
Springer
10 years 1 months ago
2016
Springer
—Path planning is an important component of autonomous mobile sensing systems. This paper studies upper and lower bounds of communication performance over Gaussian sensor network...
124
Voted
CORR
2016
Springer
10 years 1 months ago
2016
Springer
—A novel multi-terminal source coding problem motivated by biclustering applications is investigated. In this setting, two separate encoders observe two dependent memoryless proc...
130
click to vote
CORR
2016
Springer
10 years 1 months ago
2016
Springer
In [12], Hillar and Lim famously demonstrated that “multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard”. Despite ma...
