848 search results - page 11 / 170 » Randomness and the linear degrees of computability |
EUROPAR
2004
Springer
15 years 2 months ago
2004
Springer
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract--We apply Guo and Wang's relaxed belief propagation (BP) method to the estimation of a random vector from linear measurements followed by a componentwise probabilisti...
72
Voted
IDEAL
2010
Springer
14 years 8 months ago
2010
Springer
Intrusion detection in computer networks faces the problem of a large number of both false alarms and unrecognized attacks. To improve the precision of detection, various machine l...
STOC
2003
ACM
15 years 9 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...