Sciweavers

4190 search results - page 482 / 838
» Type Class Directives
Sort
View
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
15 years 7 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
BMCBI
2006
200views more  BMCBI 2006»
15 years 6 months ago
Comparison and evaluation of methods for generating differentially expressed gene lists from microarray data
Background: Numerous feature selection methods have been applied to the identification of differentially expressed genes in microarray data. These include simple fold change, clas...
Ian B. Jeffery, Desmond G. Higgins, Aedín C...
IEICET
2006
108views more  IEICET 2006»
15 years 6 months ago
Plaintext Simulatability
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
Eiichiro Fujisaki
APIN
2004
116views more  APIN 2004»
15 years 6 months ago
Neural Learning from Unbalanced Data
This paper describes the result of our study on neural learning to solve the classification problems in which data is unbalanced and noisy. We conducted the study on three differen...
Yi Lu Murphey, Hong Guo, Lee A. Feldkamp
JMLR
2002
89views more  JMLR 2002»
15 years 6 months ago
A Robust Minimax Approach to Classification
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...
Gert R. G. Lanckriet, Laurent El Ghaoui, Chiranjib...