Sciweavers

2252 search results - page 273 / 451
» Improving Random Forests
Sort
View
132
Voted
COLT
2008
Springer
15 years 2 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
15 years 2 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
123
Voted
WSC
2004
15 years 2 months ago
A Case Study in Meta-Simulation Design and Performance Analysis for Large-Scale Networks
Simulation and Emulation techniques are fundamental to aid the process of large-scale protocol design and network operations. However, the results from these techniques are often ...
David W. Bauer, Garrett R. Yaun, Christopher D. Ca...
CORR
2006
Springer
117views Education» more  CORR 2006»
15 years 25 days 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,...
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 23 days ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin