Since the emergence of Artificial Intelligence (AI) as a new field of modern science and engineering about 6 decades ago, concerted efforts have been made on designing and developing expressively adequate languages to represent knowledge about re
The class of Unambiguous Star-free regular languages over words has been variously characterized in the past by logics such as the fragments $\Delta_2[<]$ and $FO^2[<]$ of first-order definable languages, Unary Temporal Logic $TL[F,P]$ as we
Given an m x n matrix A, we define the rank-k approximation of A as a matrix B of same size and of rank at most k such that A and B are close in the Frobenius norm.
We investigate the following question: If NP contains functions which are slightly hard to compute on average then does NP also contain function which is very hard to compute on average?
We propose a model for interaction between an user-set (market) and a service-provider (firm) when the offered demand is sensitive to the offered Quality of Service.
+ Tom Kurtz, in a classic paper from 1972, showed that stochastic models for chemical reactions and deterministic models are related: in the limit of volume going to infinity, the stochastic model approaches the deterministic model.
Information theoretic secrecy provides a framework for exploring schemes that guarantee provable unconditional security in network systems. This talk explores innate structural connections that exist between the information theoretic notion of mul
