An on-line recursive algorithm for training support vector machines, one vector at a time, is presented. Adiabatic increments retain the KuhnTucker conditions on all previously se...
We consider a finite universe U (more exactly - a family U of them), second order quantifiers QK , where for each U this means quantifying over a family of n(K)-place relations clo...
We present a survey of the various families of approaches to secure aggregation in distributed networks such as sensor networks. In our survey, we focus on the important algorithm...
Haowen Chan, Hsu-Chun Hsiao, Adrian Perrig, Dawn S...
In this work, we propose a new generalization of the notion of group signatures, that allows signers to cover the entire spectrum from complete disclosure to complete anonymity. Pr...
Abstract. In this paper we consider the dictionary problem in the scalable distributed data structure paradigm introduced by Litwin, Neimat and Schneider and analyze costs for inse...