862 search results - page 156 / 173 » Random Information Spread in Networks |
110
click to vote
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— The need for efficient counter architecture has arisen for the following two reasons. Firstly, a number of data streaming algorithms and network management applications requir...
HIPC
2007
Springer
15 years 5 months ago
2007
Springer
P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necess...
ICDCSW
2006
IEEE
15 years 5 months ago
2006
IEEE
— Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simpl...
MMMACNS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. This paper presents a method to generate unique and nevertheless highly random pseudonyms in a distributed environment. More precisely, each user can now generate his pse...
107
click to vote
IH
1998
Springer
15 years 4 months ago
1998
Springer
Theoretical modeling of watermarks allow prediction of the detector reliability and facilitates the development of more reliable systems. In particular, mathematical evaluation is ...