A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Embedding algorithms are a method for revealing low dimensional structure in complex data. Most embedding algorithms are designed to handle objects of a single type for which pair...
Amir Globerson, Gal Chechik, Fernando Pereira, Naf...
: In this paper we describe the Iso-phone, a telecommunications concept providing a service that can be described simply as a meeting of the telephone and the floatation tank. By b...
We consider approximate policy evaluation for finite state and action Markov decision processes (MDP) in the off-policy learning context and with the simulation-based least square...