The main theme of this paper is to develop a novel eigenvalue optimization framework for learning a Mahalanobis metric. Within this context, we introduce a novel metric learning a...
Distance bounding protocols have been proposed as means of detecting relay attacks, also known as mafia fraud. In this paper we present the first symmetric key based distance bou...
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
This paper describes a virtual networking approach for Grids called ViNe. It enables symmetric connectivity among Grid resources and allows existing applications to run unmodified...
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
Laura Mancinska, Maris Ozols, Ilze Dzelme-Berzina,...