Sciweavers

697 search results - page 88 / 140
» On the Theory of Average Case Complexity
Sort
View
CSL
2008
Springer
13 years 9 months ago
On the Almighty Wand
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...
Rémi Brochenin, Stéphane Demri, &Eac...
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
13 years 8 months ago
Structured low-rank approximation and its applications
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...
Ivan Markovsky
CORR
2008
Springer
101views Education» more  CORR 2008»
13 years 8 months ago
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound
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...
Joshua Brody, Amit Chakrabarti
IANDC
2008
122views more  IANDC 2008»
13 years 8 months ago
Automata can show PSpace results for description logics
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...
Franz Baader, Jan Hladik, Rafael Peñaloza
JMM2
2007
157views more  JMM2 2007»
13 years 7 months ago
Sub-band Implementation of Adaptive Nonlinear Filter for Adaptive Nonlinear Echo Cancellation
—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...