Sciweavers


Publication
198views
14 years 4 months ago
A Blink Tree latch method and protocol to support synchronous node deletion
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...
Karl Malbrain
CVPR
2010
IEEE
14 years 4 months ago
Abrupt motion tracking via adaptive stochastic approximation Monte Carlo sampling
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 (...
Xiuzhuang Zhou and Yao Lu
ICCV
2011
IEEE
14 years 4 months ago
Tracking by Sampling Trackers
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...
junseok kwon and kyoung mu lee

Publication
255views
14 years 4 months ago
Ant-Q Hyper-Heuristic Approach for solving 2-Dimensional Cutting Stock Problem
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...
Imen Khamassi, Moez Hammami, Khaled Ghédira

Publication
344views
14 years 5 months ago
Top-k Similarity Join over Multi-valued Objects
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...
Wenjie Zhang, Jing Xu, Xin Liang, Ying Zhang, Xuem...