Sciweavers

6251 search results - page 1039 / 1251
» Randomness, Computability, and Density
Sort
View
CAV
2009
Springer
187views Hardware» more  CAV 2009»
16 years 5 months ago
A Markov Chain Monte Carlo Sampler for Mixed Boolean/Integer Constraints
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
Nathan Kitchen, Andreas Kuehlmann
TCC
2009
Springer
146views Cryptology» more  TCC 2009»
16 years 5 months ago
An Optimally Fair Coin Toss
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
Tal Moran, Moni Naor, Gil Segev
EWSN
2009
Springer
16 years 5 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
MOBIHOC
2009
ACM
16 years 5 months ago
A practical joint network-channel coding scheme for reliable communication in wireless networks
In this paper, we propose a practical scheme, called Non-Binary Joint Network-Channel Decoding (NB-JNCD) for reliable communication in wireless networks. It seamlessly couples cha...
Zheng Guo, Jie Huang, Bing Wang, Jun-Hong Cui, She...
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
16 years 4 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
« Prev « First page 1039 / 1251 Last » Next »