Sciweavers

1763 search results - page 159 / 353
» Dependent random choice
Sort
View
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 9 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
BMCBI
2010
190views more  BMCBI 2010»
13 years 8 months ago
Sample size and statistical power considerations in high-dimensionality data settings: a comparative study of classification alg
Background: Data generated using `omics' technologies are characterized by high dimensionality, where the number of features measured per subject vastly exceeds the number of...
Yu Guo, Armin Graber, Robert N. McBurney, Raji Bal...
CORR
2006
Springer
117views Education» more  CORR 2006»
13 years 8 months ago
Distributed Transmit Beamforming using Feedback Control
The concept of distributed transmit beamforming is implicit in many key results of network information theory. However, its implementation in a wireless network involves the funda...
Raghuraman Mudumbai, J. Hespanha, Upamanyu Madhow,...
ENTCS
2006
134views more  ENTCS 2006»
13 years 8 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
ICIP
2006
IEEE
14 years 10 months ago
Robust Object Detection using Fast Feature Selection from Huge Feature Sets
This paper describes an efficient feature selection method that quickly selects a small subset out of a given huge feature set; for building robust object detection systems. In th...
Duy-Dinh Le, Shin'ichi Satoh