Inspired by the recent work on approximating classical logic, we present a procedure that approximates the modal logic K by determining a maximum limit of introspection. This proc...
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
We reprove that the approximate degree of the OR function on n bits is ( n). We consider a linear program which is feasible if and only if there is an approximate polynomial for ...
This paper introduces an approach to behavioral pattern identification as a part of a study of temporal patterns in complex dynamical systems. Rough set theory introduced by Zdzisl...
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...