The minimum number of colors required to color the edges of a graph so that any two distinct vertices are connected by at least one path in which no two edges are colored the same is called its rainbow connection number. ...

Ranking a set of candidates or items from pair-wise comparisons is a fundamental problem that arises in many settings such as elections, recommendation systems, sports team rankings, document rankings and so on. Indeed it ...

Although vector quantization (VQ) is an established topic in communication, its practical utility has been limited due to (i) prohibitive complexity for higher quality and bit-rate, (ii) structured VQ methods which are not ...

Recent decades have witnessed a significant increment in power contribution from wind generators. This increment in penetration requires power engineers to tackle multi-fold challenges concerning operational and stability ...

Face recognition finds various applications in surveillance, Law enforcement etc. These applications require fast image processing in real time. Modern GPUs have evolved fully programmable parallel stream processors. The ...

Real-time decision making relies on the availability of accurate data and, as such, delivering status updates in a timely fashion is of paramount importance. In this thesis, we first look at the interplay between average ...

For many NP-hard problems, the analysis of best-known approximation algorithms yields “poor” worst-case guarantees. However, using various heuristics, the problems can be solved (to some extent) in real-life instances. ...