3471 search results - page 640 / 695 » Obstacle Numbers of Graphs |
135
click to vote
KDD
2008
ACM
16 years 4 months 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...
115
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
In the paper we show that diagnostic classes in cancer gene expression data sets, which most often include thousands of features (genes), may be effectively separated with simple ...
152
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
139
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
137
click to vote
EDBT
2004
ACM
16 years 3 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...