— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
Alexander C. Shkolnik, Matthew Walter, Russ Tedrak...
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
Privacy preserving data mining has been investigated extensively. The previous works mainly fall into two categories, perturbation and randomization based approaches and secure mu...
Li Liu, Murat Kantarcioglu, Bhavani M. Thuraisingh...
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...
—This paper presents an automatic segmentation algorithm for video frames captured by a (monocular) webcam that closely approximates depth segmentation from a stereo camera. The ...
Pei Yin, Antonio Criminisi, John M. Winn, Irfan A....