Sciweavers

580 search results - page 76 / 116
» Choosing a random peer
Sort
View
JMLR
2010
165views more  JMLR 2010»
14 years 6 months ago
Learning with Blocks: Composite Likelihood and Contrastive Divergence
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 5 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
84
Voted
SENSYS
2003
ACM
15 years 5 months ago
Spatiotemporal multicast in sensor networks
Sensor networks often involve the monitoring of mobile phenomena. We believe this task can be facilitated by a spatiotemporal multicast protocol which we call “mobicast”. Mobi...
Qingfeng Huang, Chenyang Lu, Gruia-Catalin Roman
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 17 days ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
FOCS
2009
IEEE
15 years 6 months ago
Extracting Correlations
Abstract— Motivated by applications in cryptography, we consider a generalization of randomness extraction and the related notion of privacy amplification to the case of two cor...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...