3641 search results - page 629 / 729 » On Computability of Pattern Recognition Problems |
157
click to vote
KDD
2012
ACM
13 years 4 months ago
2012
ACM
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...
122
click to vote
ISCI
2008
15 years 2 months ago
2008
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 ...
112
Voted
SPIRE
2010
Springer
15 years 25 days ago
2010
Springer
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...
152
click to vote
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
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...
119
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
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...