Sciweavers

3641 search results - page 629 / 729
» On Computability of Pattern Recognition Problems
Sort
View
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
12 years 15 days ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
ISCI
2008
116views more  ISCI 2008»
13 years 10 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
SPIRE
2010
Springer
13 years 8 months ago
String Matching with Variable Length Gaps
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
Philip Bille, Inge Li Gørtz, Hjalte Wedel V...
ICCV
2009
IEEE
1957views Computer Vision» more  ICCV 2009»
15 years 3 months ago
Robust Visual Tracking using L1 Minimization
In this paper we propose a robust visual tracking method by casting tracking as a sparse approximation problem in a particle filter framework. In this framework, occlusion, corru...
Xue Mei, Haibin Ling
CVPR
2008
IEEE
15 years 3 days ago
Hierarchical, learning-based automatic liver segmentation
In this paper we present a hierarchical, learning-based approach for automatic and accurate liver segmentation from 3D CT volumes. We target CT volumes that come from largely dive...
Haibin Ling, Shaohua Kevin Zhou, Yefeng Zheng, Bog...