Sciweavers

7853 search results - page 351 / 1571
» Learning from Each Other
Sort
View
ECML
2007
Springer
16 years 29 days ago
On Phase Transitions in Learning Sparse Networks
In this paper we study the identification of sparse interaction networks as a machine learning problem. Sparsity means that we are provided with a small data set and a high number...
Goele Hollanders, Geert Jan Bex, Marc Gyssens, Ron...
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
16 years 29 days ago
Knowledge reuse in genetic programming applied to visual learning
We propose a method of knowledge reuse for an ensemble of genetic programming-based learners solving a visual learning task. First, we introduce a visual learning method that uses...
Wojciech Jaskowski, Krzysztof Krawiec, Bartosz Wie...
STOC
2001
ACM
140views Algorithms» more  STOC 2001»
16 years 7 months ago
Compatible sequences and a slow Winkler percolation
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
Péter Gács
KDD
2007
ACM
142views Data Mining» more  KDD 2007»
16 years 7 months ago
Towards Privacy-Preserving Model Selection
Abstract. Model selection is an important problem in statistics, machine learning, and data mining. In this paper, we investigate the problem of enabling multiple parties to perfor...
Zhiqiang Yang, Sheng Zhong, Rebecca N. Wright
JUCS
2008
156views more  JUCS 2008»
15 years 6 months ago
Efficient k-out-of-n Oblivious Transfer Schemes
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
Cheng-Kang Chu, Wen-Guey Tzeng