3641 search results - page 183 / 729 » On Computability of Pattern Recognition Problems |
117
Voted
KDD
2008
ACM
16 years 3 months ago
2008
ACM
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
139
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
141
Voted
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
123
click to vote
JMLR
2006
15 years 3 months ago
2006
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
111
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has bee...