688 search results - page 118 / 138 » General Partitioning on Random Graphs |
115
click to vote
KDD
2007
ACM
16 years 27 days 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...
140
Voted
CORR
2010
Springer
15 years 17 days ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
118
Voted
PVLDB
2008
14 years 12 months ago
2008
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
109
Voted
PVLDB
2008
14 years 12 months ago
2008
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...