Sciweavers

35419 search results - page 179 / 7084
» How are we doing
Sort
View
SIGCOMM
2010
ACM
15 years 4 months ago
How secure are secure interdomain routing protocols
In response to high-profile Internet outages, BGP security variants have been proposed to prevent the propagation of bogus routing information. To inform discussions of which vari...
Sharon Goldberg, Michael Schapira, Peter Hummon, J...
CORR
2010
Springer
120views Education» more  CORR 2010»
15 years 4 months ago
How Much Multiuser Diversity is Required for Energy Limited Multiuser Systems?
Multiuser diversity (MUDiv) is one of the central concepts in multiuser (MU) systems. In particular, MUDiv allows for scheduling among users in order to eliminate the negative effe...
Youngwook Ko, Sergiy A. Vorobyov, Masoud Ardakani
CORR
2011
Springer
174views Education» more  CORR 2011»
14 years 11 months ago
Distributed Private Data Analysis: On Simultaneously Solving How and What
We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs – secure function evaluation (SFE) and differential...
Amos Beimel, Kobbi Nissim, Eran Omri
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
16 years 1 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
CRV
2009
IEEE
153views Robotics» more  CRV 2009»
15 years 11 months ago
Optimal Online Data Sampling or How to Hire the Best Secretaries
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...
Yogesh Girdhar, Gregory Dudek