2496 search results - page 296 / 500 » On covering by translates of a set |
164
click to vote
KDD
2008
ACM
16 years 7 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 ...
158
click to vote
CHI
2008
ACM
16 years 7 months ago
2008
ACM
Most video games require constant interaction, so game designers must pay careful attention to usability issues. However, there are few formal methods for evaluating the usability...
182
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
155
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
Given a large-scale linked document collection, such as a collection of blog posts or a research literature archive, there are two fundamental problems that have generated a lot o...
174
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...