1217 search results - page 183 / 244 » On compressing frequent patterns |
160
click to vote
KDD
2007
ACM
16 years 4 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...
234
click to vote
POPL
2002
ACM
16 years 4 months ago
2002
ACM
Program verification is a promising approach to improving program quality, because it can search all possible program executions for specific errors. However, the need to formally...
162
click to vote
BMCBI
2005
15 years 3 months ago
2005
Background: Searching for approximate patterns in large promoter sequences frequently produces an exceedingly high numbers of results. Our aim was to exploit biological knowledge ...
139
click to vote
DATE
2008
IEEE
15 years 10 months ago
2008
IEEE
Low-Cost test methodologies for Systems-on-Chip are increasingly popular. They dictate which features have to be included on-chip and which test procedures have to be adopted in o...
120
Voted
PKDD
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we introduce graph-evolution rules, a novel type of frequency-based pattern that describe the evolution of large networks over time, at a local level. Given a sequenc...