2013 search results - page 291 / 403 » Happy New Year |
107
click to vote
KDD
2008
ACM
16 years 8 days ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
100
click to vote
KDD
2004
ACM
16 years 8 days ago
2004
ACM
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
163
click to vote
SIGMOD
2008
ACM
16 years 21 hour ago
2008
ACM
In late May, 2008, a group of database researchers, architects, users and pundits met at the Claremont Resort in Berkeley, California to discuss the state of the research field an...
122
click to vote
POPL
2010
ACM
15 years 9 months ago
2010
ACM
Despite years of work on retargetable compilers, creating a good, reliable back end for an optimizing compiler still entails a lot of hard work. Moreover, a critical component of ...
105
click to vote
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
Data anonymization techniques have been the subject of intense investigation in recent years, for many kinds of structured data, including tabular, item set and graph data. They e...