92 search results - page 17 / 19 » Generating Shorter Bases for Hard Random Lattices |
AUSAI
2003
Springer
13 years 11 months ago
2003
Springer
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
SIGMOD
2010
ACM
13 years 6 months ago
2010
ACM
Most previous research on privacy-preserving data publishing, based on the k-anonymity model, has followed the simplistic approach of homogeneously giving the same generalized val...
MOBIHOC
2005
ACM
14 years 6 months ago
2005
ACM
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
ICS
2009
Tsinghua U.
13 years 11 months ago
2009
Tsinghua U.
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
KDD
2008
ACM
14 years 6 months ago
2008
ACM
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...