16404 search results - page 225 / 3281 » A set coverage problem |
128
click to vote
CASDMKM
2004
Springer
15 years 9 months ago
2004
Springer
This paper conducts experiments with three skewed data sets, seeking to demonstrate problems when skewed data is used, and identifying counter problems when data is balanced. The b...
121
click to vote
LREC
2008
15 years 5 months ago
2008
Spectral clustering is a powerful clustering method for document data set. However, spectral clustering needs to solve an eigenvalue problem of the matrix converted from the simil...
164
click to vote
DC
2010
15 years 4 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
196
Voted
AAAI
2011
14 years 4 months ago
2011
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
158
click to vote
VSTTE
2012
Springer
13 years 11 months ago
2012
Springer
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...