2254 search results - page 308 / 451 » Computing the minimal covering set |
125
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
The problem of identifying the minimal gene set required to sustain life is of crucial importance in understanding cellular mechanisms and designing therapeutic drugs. This work d...
162
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
259
Voted
VLDB
2002
ACM
16 years 6 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
272
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
170
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
— Many applications require sorting a table over multiple sort orders: generation of multiple reports from a table, evaluation of a complex query that involves multiple instances...