This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
Term translation probabilities proved an effective method of semantic smoothing in the language modelling approach to information retrieval. We use Generalized Latent Semantic Ana...
We present a new general framework for online istic plan recognition called the Abstract Hidden Markov Memory Model (AHMEM). The l is an extension of the existing Abstract Hidden ...
— In this paper, we present design methods to optimize nonlinear phase functions of Generalized DFT (GDFT) for minimized auto and cross correlations. It is shown that GDFT offers...
: This work deals with a classic problem: "Given a set of coins among which there is a counterfeit coin of a different weight, find this counterfeit coin using ordinary balanc...