Sciweavers

1369 search results - page 126 / 274
» Lattice computations for random numbers
Sort
View
FOCS
2006
IEEE
14 years 3 months ago
New Results for Learning Noisy Parities and Halfspaces
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, A...
ALGORITHMICA
2007
165views more  ALGORITHMICA 2007»
13 years 9 months ago
Motorcycle Graphs and Straight Skeletons
We present a new algorithm to compute motorcycle graphs. It runs in O(n √ n log n) time when n is the number of motorcycles. We give a new characterization of the straight skele...
Siu-Wing Cheng, Antoine Vigneron
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
14 years 9 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
VLDB
2005
ACM
132views Database» more  VLDB 2005»
14 years 9 months ago
Hash-based labeling techniques for storage scaling
Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...
Shu-Yuen Didi Yao, Cyrus Shahabi, Per-Åke Larson
LCN
2006
IEEE
14 years 3 months ago
Bandwidth Aware Slot Allocation in Hybrid MAC
— Hybrid Medium Access Control (MAC) protocols combine the strength of random and schedule based MAC schemes. From random MAC schemes, Hybrid MAC protocols borrow flexibility an...
Yuvraj. K. Rana, Bao Hua Liu, Alfandika Nyandoro, ...