Sciweavers

612 search results - page 23 / 123
» Using Data Compressors to Construct Rank Tests
Sort
View
FC
2005
Springer
142views Cryptology» more  FC 2005»
15 years 3 months ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova
92
Voted
RIAO
2007
14 years 11 months ago
Homepage Finding in Hybrid Peer-to-Peer Networks
This paper illustrates a ranking scheme which combines fulltext, anchor text and URL structure for homepage finding in hybrid peer-to-peer networks. The experimental results show...
Enrico Bragante, Massimo Melucci
101
Voted
DIS
2008
Springer
14 years 12 months ago
Unsupervised Classifier Selection Based on Two-Sample Test
We propose a well-founded method of ranking a pool of m trained classifiers by their suitability for the current input of n instances. It can be used when dynamically selecting a s...
Timo Aho, Tapio Elomaa, Jussi Kujala
96
Voted
GPEM
2002
104views more  GPEM 2002»
14 years 10 months ago
Genetic Programming-based Construction of Features for Machine Learning and Knowledge Discovery Tasks
In this paper we use genetic programming for changing the representation of the input data for machine learners. In particular, the topic of interest here is feature construction i...
Krzysztof Krawiec
BMCBI
2007
157views more  BMCBI 2007»
14 years 10 months ago
Constructing gene co-expression networks and predicting functions of unknown genes by random matrix theory
Background: Large-scale sequencing of entire genomes has ushered in a new age in biology. One of the next grand challenges is to dissect the cellular networks consisting of many i...
Feng Luo, Yunfeng Yang, Jianxin Zhong, Haichun Gao...