Sciweavers

1984 search results - page 44 / 397
» Binary Component Adaptation
Sort
View
PPOPP
2010
ACM
15 years 7 months ago
A practical concurrent binary search tree
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,...
ICTAI
2003
IEEE
15 years 3 months ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
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...
David Bellot, Pierre Bessière
ICCV
2011
IEEE
13 years 9 months ago
BRISK: Binary Robust Invariant Scalable Keypoints
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...
CORR
2004
Springer
110views Education» more  CORR 2004»
14 years 9 months ago
Evolving a Stigmergic Self-Organized Data-Mining
Vitorino Ramos, Ajith Abraham
IJCNN
2006
IEEE
15 years 3 months ago
Nominal-scale Evolving Connectionist Systems
— 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 ...
Michael J. Watts