Sciweavers

2434 search results - page 72 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
148
Voted
ACM
1995
15 years 7 months ago
Rough Sets
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
Zdzislaw Pawlak
122
Voted
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 4 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
132
Voted
TIT
1998
105views more  TIT 1998»
15 years 3 months ago
Diversity Waveform Sets for Delay-Doppler Imaging
Abstract— Properties of the ambiguity function and the uncertainty relation of Fourier transforms assert fundamental limitations on the ability of any single radar waveform of co...
Jiann-Ching Guey, Mark R. Bell
JMLR
2012
13 years 5 months ago
Random Search for Hyper-Parameter Optimization
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...
James Bergstra, Yoshua Bengio
RC
2006
88views more  RC 2006»
15 years 3 months ago
Geometric Constructions with Discretized Random Variables
We generalize the DEnv (Distribution envelope determination) method for bounding the result of arithmetic operations on random variables with unknown dependence to higher-dimension...
Hans-Peter Schröcker, Johannes Wallner