15485 search results - page 2735 / 3097 » Computing Optimal Subsets |
165
click to vote
CIKM
2004
Springer
16 years 4 days ago
2004
Springer
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
177
click to vote
COCO
2004
Springer
16 years 4 days ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
150
click to vote
CPM
2004
Springer
16 years 4 days ago
2004
Springer
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
174
Voted
ECUMN
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. MPNT (Multicast Proxies NeTwork) is an overlay architecture that was first conceived to provide multicast access to unicast-only users, like TutTelNet distant students. ...
208
click to vote
ESAS
2004
Springer
16 years 4 days ago
2004
Springer
In this paper we describe the advantages of using iterative Diffie-Hellman (IDH) key trees for mobile ad-hoc group communication. We focus on the Treebased Group Diffie-Hellman (...