5606 search results - page 606 / 1122 » Randomization Techniques for Graphs. |
202
Voted
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We consider the problem of classification of a pattern from multiple compressed observations that are collected in a sensor network. In particular, we exploit the properties of r...
160
click to vote
JSAC
2006
15 years 7 months ago
2006
This paper studies the design of signaling waveforms for time-hopping impulse radio (TH-IR) with limits on the power spectral density. Such restrictions are imposed by the spectra...
217
click to vote
ASIACRYPT
2011
Springer
14 years 7 months ago
2011
Springer
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
185
click to vote
SAS
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
179
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We describe an efficient algorithm for releasing a provably private estimate of the degree distribution of a network. The algorithm satisfies a rigorous property of differenti...