1434 search results - page 233 / 287 » Distributed Computing with Imperfect Randomness |
95
Voted
ISPAN
2005
IEEE
15 years 7 months ago
2005
IEEE
In this paper we present a general methodology for designing supervised peer-to-peer systems. A supervised peer-to-peer system is a system in which the overlay network is formed b...
121
Voted
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
142
Voted
AIME
2009
Springer
15 years 6 months ago
2009
Springer
We use the concept of conditional mutual information (MI) to approach problems involving the selection of variables in the area of medical diagnosis. Computing MI requires estimate...
121
Voted
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
131
click to vote
DCOSS
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...