3641 search results - page 219 / 729 » On Computability of Pattern Recognition Problems |
208
click to vote
BALT
2010
15 years 2 months ago
2010
Abstract. This paper addresses the pattern matching problem for model transformation languages. Despite being an NP-complete problem, the pattern matching can be solved efficiently...
229
click to vote
ADMA
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. Practical pattern classification and knowledge discovery problems require selecting a useful subset of features from a much larger set to represent the patterns to be cl...
164
click to vote
COR
2007
15 years 7 months ago
2007
Both the material usage and the complexity of the cutting process should be considered in generating cutting patterns. This paper presents an exact algorithm for constrained two-d...
207
click to vote
KDD
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...
151
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we propose a scheme to improve the performance of subspace learning by using a pattern(data) selection method as preprocessing. Generally, a training set for subspa...