226 search results - page 37 / 46 » A Practical Algorithm to Find the Best Subsequence Patterns |
SIGMOD
1996
ACM
13 years 11 months ago
1996
ACM
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Heuristic Algorithms (HA) are very widely used to tackle practical problems in operations research. They are simple, easy to understand and inspire confidence. Many of these HAs a...
KDD
2007
ACM
14 years 7 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
In contrast to classical databases and IR systems, real-world information systems have to deal increasingly with very vague and diverse structures for information management and s...