3641 search results - page 82 / 729 » On Computability of Pattern Recognition Problems |
129
Voted
ICDM
2007
IEEE
15 years 7 months ago
2007
IEEE
Inspired by emerging multi-core computer architectures, in this paper we present MT CLOSED, a multi-threaded algorithm for frequent closed itemset mining (FCIM). To the best of ou...
98
Voted
ISAAC
2001
Springer
15 years 5 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
90
Voted
IWANN
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. It is generally accepted that some of the problems and ambiguities at the low level of processing can not be resolved without taking into account contextual expectations....
114
click to vote
AUTOID
2005
IEEE
15 years 6 months ago
2005
IEEE
Following Daubert in 1993, forensic evidence based on fingerprints was first challenged in the 1999 case of USA vs. Byron Mitchell, and subsequently, in 20 other cases involving...
88
Voted
PRL
2002
15 years 7 days ago
2002
As a new pattern classification method, nearest feature line (NFL) provides an effective way to tackle the sort of pattern recognition problems where only limited data are availab...