A new Blink Tree latching method and protocol simplifies implementation of Lehman and Yao's high
concurrency Blink Tree with Jaluta's balanced Blink Tree methods with in...
Robust tracking of abrupt motion is a challenging task
in computer vision due to the large motion uncertainty. In
this paper, we propose a stochastic approximation Monte
Carlo (...
We propose a novel tracking framework called visual tracker sampler that tracks a target robustly by searching for the appropriate trackers in each frame. Since the real-world trac...
Hyper-heuristics are new approaches which aim at raising the level of abstraction when solving combinatorial optimisation problems. In this paper we introduce a new hyper-heuristi...
The top-k similarity joins have been extensively studied and used
in a wide spectrum of applications such as information retrieval, decision
making, spatial data analysis and dat...