16404 search results - page 905 / 3281 » A set coverage problem |
222
click to vote
PAMI
2011
15 years 2 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
232
click to vote
SGAI
2010
Springer
15 years 2 months ago
2010
Springer
: In the present paper we address the problem of computing the Minimal Additional Sensor Sets (MASS) that guarantee a desired level of diagnostic discrimination for a system. Recen...
218
Voted
CHI
2011
ACM
14 years 11 months ago
2011
ACM
We performed a study of Facebook users to examine how they coped with limitations of the Facebook privacy settings interface. Students graduating and joining the workforce create ...
419
Voted
SPIN
2012
Springer
13 years 10 months ago
2012
Springer
Since counterexamples generated by model checking tools are only symptoms of faults in the model, a significant amount of manual work is required in order to locate the fault that...
233
click to vote
SDM
2012
SIAM
13 years 10 months ago
2012
SIAM
Finding latent factors of the data using matrix factorizations is a tried-and-tested approach in data mining. But finding shared factors over multiple matrices is more novel prob...