Sciweavers

2157 search results - page 194 / 432
» Binary ant algorithm
Sort
View
IJCNN
2006
IEEE
16 years 13 days ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
PKC
2005
Springer
109views Cryptology» more  PKC 2005»
15 years 12 months ago
Fast Multi-computations with Integer Similarity Strategy
Abstract. Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithm...
Wu-Chuan Yang, Dah-Jyh Guan, Chi-Sung Laih
GECCO
2004
Springer
135views Optimization» more  GECCO 2004»
15 years 11 months ago
CellNet Co-Ev: Evolving Better Pattern Recognizers Using Competitive Co-evolution
A model for the co-evolution of patterns and classifiers is presented. The CellNet system for generating binary classifiers is used as a base for experimentation. The CellNet syste...
Taras Kowaliw, Nawwaf N. Kharma, Chris Jensen, Hus...
EUROCRYPT
1998
Springer
15 years 10 months ago
How to Improve an Exponentiation Black-Box
Abstract. In this paper we present a method for improving the performance of RSA-type exponentiations. The scheme is based on the observation that replacing the exponent d by d = d...
Gérard D. Cohen, Antoine Lobstein, David Na...
166
Voted
APPROX
2006
Springer
100views Algorithms» more  APPROX 2006»
15 years 10 months ago
Robust Local Testability of Tensor Products of LDPC Codes
Given two binary linear codes R and C, their tensor product R C consists of all matrices with rows in R and columns in C. We analyze the "robustness" of the following te...
Irit Dinur, Madhu Sudan, Avi Wigderson