Sciweavers

5138 search results - page 38 / 1028
» Low-Entropy Set Selection.
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...
SIGIR
2012
ACM
12 years 12 days ago
Automatic term mismatch diagnosis for selective query expansion
People are seldom aware that their search queries frequently mismatch a majority of the relevant documents. This may not be a big problem for topics with a large and diverse set o...
Le Zhao, Jamie Callan
BMCBI
2007
102views more  BMCBI 2007»
13 years 10 months ago
Setting up a large set of protein-ligand PDB complexes for the development and validation of knowledge-based docking algorithms
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
Luis A. Diago, Persy Morell, Longendri Aguilera, E...
ILP
2003
Springer
14 years 3 months ago
A Comparative Evaluation of Feature Set Evolution Strategies for Multirelational Boosting
Boosting has established itself as a successful technique for decreasing the generalization error of classification learners by basing predictions on ensembles of hypotheses. Whil...
Susanne Hoche, Stefan Wrobel
NN
2002
Springer
144views Neural Networks» more  NN 2002»
13 years 9 months ago
Projective ART for clustering data sets in high dimensional spaces
A new neural network architecture (PART) and the resulting algorithm are proposed to
Yongqiang Cao, Jianhong Wu