4913 search results - page 858 / 983 » Results and Perspectives of the G |
152
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
169
click to vote
ACISP
2004
Springer
15 years 12 months ago
2004
Springer
In this paper, we study the problem of single database private information retrieval, and present schemes with only logarithmic server-side communication complexity. Previously th...
196
click to vote
MOBICOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
180
click to vote
VRST
2003
ACM
15 years 11 months ago
2003
ACM
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
163
click to vote
CIKM
2003
Springer
15 years 11 months ago
2003
Springer
As online document collections continue to expand, both on the Web and in proprietary environments, the need for duplicate detection becomes more critical. Few users wish to retri...