Sciweavers

3247 search results - page 556 / 650
» Randomized smoothing networks
Sort
View
INFOCOM
2006
IEEE
16 years 5 days ago
Controlled Flooding Search with Delay Constraints
— In this paper we consider the problem of query and search in a network, e.g., searching for a specific node or a piece of data. We limit our attention to the class of TTL (tim...
Nicholas B. Chang, Mingyan Liu
WISE
2006
Springer
16 years 4 days ago
Finding Reliable Recommendations for Trust Model
This paper presents a novel context-based approach to find reliable recommendations for trust model in ubiquitous environments. Context is used in our approach to analyze the user...
Weiwei Yuan, Donghai Guan, Sungyoung Lee, Young-Ko...
SAC
2006
ACM
16 years 2 days ago
Efficient query routing for information retrieval in semantic overlays
A fundamental problem in peer-to-peer networks is how to locate appropriate peers efficiently to answer a specific query request. This paper proposes a model in which semantically...
Hai Jin, Xiaoming Ning, Hanhua Chen, Zuoning Yin
DSN
2005
IEEE
15 years 11 months ago
Perturbation-Resistant and Overlay-Independent Resource Discovery
This paper realizes techniques supporting the position that strategies for resource location and discovery in distributed systems should be both perturbation-resistant and overlay...
Steven Y. Ko, Indranil Gupta
INFOCOM
2005
IEEE
15 years 11 months ago
The one-to-many TCP overlay: a scalable and reliable multicast architecture
Abstract— We consider reliable multicast in overlay networks where nodes have finite-size buffers and are subject to failures. We address issues of end-to-end reliability and th...
François Baccelli, Augustin Chaintreau, Zhe...