Sciweavers

2376 search results - page 197 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
15 years 11 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
ICCV
2009
IEEE
16 years 2 months ago
The Swap and Expansion Moves Revisited and Fused
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...
Ido Leichter
106
Voted
CVPR
2006
IEEE
16 years 1 months ago
Fusion of Detection and Matching Based Approaches for Laser Based Multiple People Tracking
Most of visual tracking algorithms have been achieved by matching-based searching strategies or detection-based data association algorithms. In this paper, our objective is to ana...
Jinshi Cui, Huijing Zhao, Ryosuke Shibasaki
100
Voted
CVPR
2007
IEEE
16 years 1 months ago
3D Probabilistic Feature Point Model for Object Detection and Recognition
This paper presents a novel statistical shape model that can be used to detect and localise feature points of a class of objects in images. The shape model is inspired from the 3D...
Sami Romdhani, Thomas Vetter
77
Voted
ECCV
2006
Springer
16 years 1 months ago
Background Cut
Abstract. In this paper, we introduce background cut, a high quality and realtime foreground layer extraction algorithm. From a single video sequence with a moving foreground objec...
Jian Sun, Weiwei Zhang, Xiaoou Tang, Heung-Yeung S...