This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Vi...
In this paper we describe novel metrics measuring complexity in self-organising networks. The metrics are investigated within the context of decentralised inspections, developed a...
To become robust, a tracking algorithm must be able to support uncertainty and ambiguity often inherently present in the data in form of occlusion and clutter. This comes usually ...
In this paper we present a methodology for deciding the bidding strategy of agents participating in a significant number of simultaneous auctions, when finding an analytical sol...
In this paper, we propose robust methods to detect image resizing. A common problem affecting most resizing detection algorithms is that they are susceptible to JPEG compression a...
Lakshmanan Nataraj, Anindya Sarkar, Bangalore S. M...