We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
—The adaptive Volterra filter has been successfully applied in nonlinear acoustic echo cancellation (AEC) systems and nonlinear line echo cancellation systems, but its applicatio...
Dayong Zhou, Yunhua Wang, Victor E. DeBrunner, Lin...