Sciweavers

4553 search results - page 309 / 911
» Distributed Ranked Search
Sort
View
FTDCS
2004
IEEE
15 years 10 months ago
Exploiting Semantic Proximity in Peer-to-Peer Content Searching
A lot of recent work has dealt with improving performance of content searching in peer-to-peer file sharing systems. In this paper we attack this problem by modifying the overlay ...
Spyros Voulgaris, Anne-Marie Kermarrec, Laurent Ma...
IPPS
2008
IEEE
16 years 1 months ago
Absolute Slicing in Peer-to-peer Systems
Peer-to-peer (P2P) systems are slowly moving from application-specific architectures to a generic serviceoriented design framework. The idea is to allow a dynamic collection of P...
Alberto Montresor, Roberto Zandonati
SASO
2007
IEEE
16 years 1 months ago
In Search of Simplicity: A Self-Organizing Group Communication Overlay
Group communication primitives have broad utility as building blocks for distributed applications. The challenge is to create and maintain the distributed structures that support ...
Matei Ripeanu, Adriana Iamnitchi, Ian T. Foster, A...
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 8 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
CORR
2007
Springer
95views Education» more  CORR 2007»
15 years 6 months ago
A Note on the Periodicity and the Output Rate of Bit Search Type Generators
We investigate the bit-search type irregular decimation algorithms that are used within LFSR-based stream ciphers. In particular, we concentrate on BSG and ABSG, and consider two ...
Yucel Altug, N. Polat Ayerden, Mehmet Kivanç...