Sciweavers

744 search results - page 129 / 149
» Weight Multiplicities for so5(C)
Sort
View
FOCS
2010
IEEE
15 years 4 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan
CORR
2011
Springer
202views Education» more  CORR 2011»
15 years 1 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
TIT
2010
143views Education» more  TIT 2010»
15 years 24 days ago
Asynchronous CDMA systems with random spreading-part I: fundamental limits
Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit. We allow for arbitrary chip waveforms and ...
Laura Cottatellucci, Ralf R. Müller, Mé...
TON
2010
99views more  TON 2010»
15 years 23 days ago
Rate Control With Pairwise Intersession Network Coding
In this paper, we develop a distributed rate-control algorithm for networks with multiple unicast sessions when network coding is allowed across different sessions. Building on rec...
Abdallah Khreishah, Chih-Chun Wang, Ness B. Shroff
OA
1989
237views Algorithms» more  OA 1989»
15 years 10 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph