Sciweavers

1268 search results - page 92 / 254
» An Algorithm for Distributed Beacon Selection
Sort
View
SIGIR
2006
ACM
15 years 7 months ago
Capturing collection size for distributed non-cooperative retrieval
Modern distributed information retrieval techniques require accurate knowledge of collection size. In non-cooperative environments, where detailed collection statistics are not av...
Milad Shokouhi, Justin Zobel, Falk Scholer, Seyed ...
INFOCOM
2003
IEEE
15 years 7 months ago
Distributed Construction of Random Expander Networks
— We present a novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles. The protocol is completely decentralized as no globall...
Ching Law, Kai-Yeung Siu
CIKM
2009
Springer
15 years 5 months ago
Multidimensional routing indices for efficient distributed query processing
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
IJHPCA
2006
113views more  IJHPCA 2006»
15 years 1 months ago
Heterogeneity-Aware Workload Distribution in Donation-Based Grids
In this paper, we explore the tradeoffs and opportunities in porting a high-throughput Grid computing middleware to a high-performance service oriented environment. We present the...
Rahul Trivedi, Abhishek Chandra, Jon B. Weissman
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 9 days ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale