Sciweavers

1159 search results - page 115 / 232
» On relevance distributions
Sort
View
179
Voted
FOCS
2008
IEEE
16 years 1 months ago
k-Wise Independent Random Graphs
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
Noga Alon, Asaf Nussboim
189
Voted
IPPS
2007
IEEE
16 years 1 months ago
Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
Joseph R. Crobak, Jonathan W. Berry, Kamesh Maddur...
199
Voted
DPD
2006
123views more  DPD 2006»
15 years 7 months ago
Reducing network traffic in unstructured P2P systems using Top-k queries
A major problem of unstructured P2P systems is their heavy network traffic. This is caused mainly by high numbers of query answers, many of which are irrelevant for users. One solu...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez
199
Voted
IPPS
2003
IEEE
16 years 9 days ago
On the Appropriateness of Commodity Operating Systems for Large-Scale, Balanced Computing Systems
In the past five years, we have been involved in the design and development of Cplanttm . An important goal was to take advantages of commodity approaches wherever possible. In p...
Ron Brightwell, Arthur B. Maccabe, Rolf Riesen
158
Voted
WAIM
2004
Springer
16 years 11 days ago
DHT Based Searching Improved by Sliding Window
Efficient full-text searching is a big challenge in Peer-to-Peer (P2P) system. Recently, Distributed Hash Table (DHT) becomes one of the reliable communication schemes for P2P. Som...
Shen Huang, Gui-Rong Xue, Xing Zhu, Yan-Feng Ge, Y...