Sciweavers

3422 search results - page 20 / 685
» Random Subset Optimization
Sort
View
INFOCOM
2005
IEEE
15 years 7 months ago
Non-uniform random membership management in peer-to-peer networks
Abstract— Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would beneï¬...
Ming Zhong, Kai Shen, Joel I. Seiferas
ICPR
2008
IEEE
16 years 3 months ago
The implication of data diversity for a classifier-free ensemble selection in random subspaces
Ensemble of Classifiers (EoC) has been shown effective in improving the performance of single classifiers by combining their outputs. By using diverse data subsets to train classi...
Albert Hung-Ren Ko, Robert Sabourin, Luiz E. Soare...
IJBC
2007
86views more  IJBC 2007»
15 years 1 months ago
Optimization and the Miranda Approach in Detecting Horseshoe-Type Chaos by Computer
f of the underlying abstract theorem avoids of referring to any results of applied algebraic topology and relies only on the Brouwer ï¬xed point theorem. The second novelty is tha...
Balázs Bánhelyi, Tibor Csendes, Barn...
111
Voted
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 3 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
CORR
2008
Springer
106views Education» more  CORR 2008»
15 years 2 months ago
Spectral efficiency and optimal medium access control of random access systems over large random spreading CDMA
This paper analyzes the spectral efficiency as a function of medium access control (MAC) for large random spreading CDMA random access systems that employ a linear receiver. It is ...
Yi Sun