Change of measure techniques are ubiquitous in many areas of applied probability including in model selection in finance and in efficient simulation of rare events.
As is well known, options and other financial derivatives acquire their value from the underlying assets such as stocks and bonds and are traded extensively in the financial markets.
To describe searching in its simplest abstract setting, suppose we have some accumulated data (called the 'file') and some new data item (called the 'sample'). Then, searching consists of relating the sample to the file.
Data security challenges faced in the modern world demand functionality from encryption systems that traditional public key cryptography falls far short in delivering.
We present a fully polynomial time approximation scheme (FPTAS) for optimizing a very general class of non-linear functions of low rank over a polytope.
The widespread use of internet has raised serious concerns of privacy and trust. In order to address these concerns, cryptographic protocols are widely used.
