4212 search results - page 770 / 843 » On Compressible Pairings and Their Computation |
179
click to vote
HPDC
2008
IEEE
16 years 25 days ago
2008
IEEE
Self-configuring virtual networks rely on structured P2P routing to provide seamless connectivity among nodes through overlay routing of virtual IP packets, support decentralized...
157
click to vote
FOCS
2006
IEEE
16 years 13 days ago
2006
IEEE
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
181
click to vote
SPAA
2006
ACM
16 years 10 days ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
170
click to vote
CCGRID
2005
IEEE
16 years 9 hour ago
2005
IEEE
ABSTRACT. Objectives. This paper addresses Grid-based integration and access of distributed data from infectious disease patient databases, literature on in-vitro and in-vivo pharm...
156
click to vote
PODC
2005
ACM
15 years 12 months ago
2005
ACM
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...