Sciweavers

1456 search results - page 54 / 292
» Improved Randomized Results for That Interval Selection Prob...
Sort
View
IFIP12
2008
15 years 5 months ago
A Study with Class Imbalance and Random Sampling for a Decision Tree Learning System
Sampling methods are a direct approach to tackle the problem of class imbalance. These methods sample a data set in order to alter the class distributions. Usually these methods ar...
Ronaldo C. Prati, Gustavo E. A. P. A. Batista, Mar...
WWW
2004
ACM
16 years 5 months ago
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
Fabien Mathieu, Mohamed Bouklit
EVOW
2007
Springer
15 years 10 months ago
Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems
Abstract. Addressing dynamic optimization problems has been a challenging task for the genetic algorithm community. Over the years, several approaches have been developed into gene...
Shengxiang Yang
ALT
2011
Springer
14 years 4 months ago
On Noise-Tolerant Learning of Sparse Parities and Related Problems
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
Elena Grigorescu, Lev Reyzin, Santosh Vempala
CRYPTO
2008
Springer
84views Cryptology» more  CRYPTO 2008»
15 years 6 months ago
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Loka...