Sciweavers

2638 search results - page 279 / 528
» Random Geometric Complexes
Sort
View
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 8 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
SIGIR
2008
ACM
15 years 6 months ago
A simple and efficient sampling method for estimating AP and NDCG
We consider the problem of large scale retrieval evaluation. Recently two methods based on random sampling were proposed as a solution to the extensive effort required to judge te...
Emine Yilmaz, Evangelos Kanoulas, Javed A. Aslam
IJON
2007
184views more  IJON 2007»
15 years 6 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen
SAC
2008
ACM
15 years 6 months ago
A hybrid software-based self-testing methodology for embedded processor
Software-based self-test (SBST) is emerging as a promising technology for enabling at-speed testing of high-speed embedded processors testing in an SoC system. For SBST, test rout...
Tai-Hua Lu, Chung-Ho Chen, Kuen-Jong Lee
ASIACRYPT
2011
Springer
14 years 6 months ago
Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
Yi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, A...