7106 search results - page 1185 / 1422 » Restricted Complexity, General Complexity |
191
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
204
click to vote
KDD
2007
ACM
16 years 6 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...
177
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
171
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Motivation: In the field of bioinformatics there is an emerging need to integrate all knowledge discovery steps into a standardized modular framework. Indeed, component-based deve...
297
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
Communication is becoming one of the central elements in software development. As a potential typed foundation for structured communication-centred programming, session types have...