Sciweavers

14054 search results - page 110 / 2811
» P
Sort
View
146
Voted
CIKM
2008
Springer
15 years 6 months ago
Estimating the number of answers with guarantees for structured queries in p2p databases
Structured P2P overlays supporting standard database functionalities are a popular choice for building large-scale distributed data management systems. In such systems, estimating...
Marcel Karnstedt, Kai-Uwe Sattler, Michael Ha&szli...
ICAIL
2007
ACM
15 years 5 months ago
P2P systems in legal networks: another "small world" case
The “small world”-paradigm offers a new interesting viewpoint for the analysis of contemporary legal networks and artificial intelligence. This topological approach sheds fu...
Ugo Pagallo, Giancarlo Ruffo
IJAHUC
2008
118views more  IJAHUC 2008»
15 years 4 months ago
Analysis models for unguided search in unstructured P2P networks
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
Bin Wu, Ajay D. Kshemkalyani
ENTCS
2006
123views more  ENTCS 2006»
15 years 4 months ago
Nonmonotonic Trust Management for P2P Applications
Community decisions about access control in virtual communities are non-monotonic in nature. This means that they cannot be expressed in current, monotonic trust management langua...
Marcin Czenko, Ha Tran, Jeroen Doumen, Sandro Etal...
CN
2007
148views more  CN 2007»
15 years 4 months ago
Optimizing random walk search algorithms in P2P networks
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
Nabhendra Bisnik, Alhussein A. Abouzeid