We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
Effective and efficient generation of keypoints from an image is a well-studied problem in the literature and forms the basis of numerous Computer Vision applications. Establishe...
Stefan Leutenegger, Margarita Chli, Roland Y. Sieg...
— A method is presented for extending the Evolving Connectionist System (ECoS) algorithm that allows it to explicitly represent and learn nominal-scale data without the need for ...