425 search results - page 52 / 85 » Polynomial Time Data Reduction for Dominating Set |
102
click to vote
EDBT
2009
ACM
15 years 3 months ago
2009
ACM
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
102
click to vote
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
103
click to vote
ICDM
2008
IEEE
15 years 5 months ago
2008
IEEE
We consider the problem of Semi-supervised Learning (SSL) from general unlabeled data, which may contain irrelevant samples. Within the binary setting, our model manages to better...
123
click to vote
SDM
2011
SIAM
14 years 2 months ago
2011
SIAM
A binary matrix is fully nested if its columns form a chain of subsets; that is, any two columns are ordered by the subset relation, where we view each column as a subset of the r...
CADE
2005
Springer
15 years 11 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...