Sciweavers

87 search results - page 5 / 18
» Random Selection with an Adversarial Majority
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Provably competitive adaptive routing
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
Baruch Awerbuch, David Holmer, Herbert Rubens, Rob...
ICALP
2007
Springer
14 years 2 months ago
Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming
We present lower bounds on the space required to estimate the quantiles of a stream of numerical values. Quantile estimation is perhaps the most studied problem in the data stream ...
Sudipto Guha, Andrew McGregor
GECCO
2006
Springer
171views Optimization» more  GECCO 2006»
13 years 11 months ago
Evolving ensemble of classifiers in random subspace
Various methods for ensemble selection and classifier combination have been designed to optimize the results of ensembles of classifiers. Genetic algorithm (GA) which uses the div...
Albert Hung-Ren Ko, Robert Sabourin, Alceu de Souz...
ICC
2009
IEEE
127views Communications» more  ICC 2009»
14 years 2 months ago
Wireless Location Privacy Protection in Vehicular Ad-Hoc Networks
Abstract—Advances in mobile networks and positioning technologies have made location information a valuable asset in vehicular ad-hoc networks (VANETs). However, the availability...
Joo-Han Song, Vincent W. S. Wong, Victor C. M. Leu...
SIAMCOMP
2011
13 years 2 months ago
Black-Box Constructions of Protocols for Secure Computation
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yeh...