6251 search results - page 391 / 1251 » Randomness, Computability, and Density |
185
click to vote
SAT
2005
Springer
16 years 8 days ago
2005
Springer
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
196
click to vote
IPTPS
2003
Springer
15 years 12 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
212
click to vote
ICEB
2004
15 years 8 months ago
2004
Electronic surveys are an important resource in data mining. However, how to protect respondents' data privacy during the survey is a challenge to the security and privacy co...
158
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
180
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...