Sciweavers

1369 search results - page 75 / 274
» Lattice computations for random numbers
Sort
View
ICALP
2004
Springer
14 years 2 months ago
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tom&aac...
ICDM
2005
IEEE
143views Data Mining» more  ICDM 2005»
14 years 2 months ago
Effective Estimation of Posterior Probabilities: Explaining the Accuracy of Randomized Decision Tree Approaches
There has been increasing number of independently proposed randomization methods in different stages of decision tree construction to build multiple trees. Randomized decision tre...
Wei Fan, Ed Greengrass, Joe McCloskey, Philip S. Y...
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
14 years 10 months ago
OptRR: Optimizing Randomized Response Schemes for Privacy-Preserving Data Mining
The randomized response (RR) technique is a promising technique to disguise private categorical data in Privacy-Preserving Data Mining (PPDM). Although a number of RR-based methods...
Zhengli Huang, Wenliang Du
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 9 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden