627 search results - page 47 / 126 » Privacy-Preserving k-NN for Small and Large Data Sets |
KDD
2000
ACM
15 years 2 months ago
2000
ACM
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
BMCBI
2006
14 years 11 months ago
2006
Background: Intensity values measured by Affymetrix microarrays have to be both normalized, to be able to compare different microarrays by removing non-biological variation, and s...
107
click to vote
CIKM
1993
Springer
15 years 3 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
HCI
2009
14 years 9 months ago
2009
The availability of video format sign language corpora limited. This leads to a desire for techniques which do not rely on large, fully-labelled datasets. This paper covers various...
INTERSPEECH
2010
14 years 6 months ago
2010
Supervised methods for extractive speech summarization require a large training set. Summary annotation is often expensive and time consuming. In this paper, we exploit semisuperv...