Sciweavers

580 search results - page 57 / 116
» Choosing a random peer
Sort
View
EUROPAR
2009
Springer
15 years 6 months ago
Uniform Sampling for Directed P2P Networks
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
Cyrus P. Hall, Antonio Carzaniga
INFOCOM
2005
IEEE
15 years 5 months ago
Assisted peer-to-peer search with partial indexing
—In the past few years, peer-to-peer (P2P) networks have become a promising paradigm for building a wide variety of distributed systems and applications. The most popular P2P app...
Rongmei Zhang, Y. Charlie Hu
HICSS
2010
IEEE
240views Biometrics» more  HICSS 2010»
15 years 6 months ago
Can e-Government Adopters Benefit from a Technology-First Approach? The Case of Egypt Embarking on Service-Oriented Architecture
It seems common sense that “policy matters” in setting up e-government interoperability, mainly because collaboration should be guided by dedicated integration objectives and ...
Ralf Klischewski, Ranwa Abubakr
MMM
2006
Springer
116views Multimedia» more  MMM 2006»
15 years 5 months ago
Effective similarity search in multimedia databases using multiple representations
Similarity search in large multimedia databases is an important issue in nowadays multimedia environment. Multimedia objects such as music videos usually consist of multiple repre...
Hans-Peter Kriegel, Peer Kröger, Peter Kunath...
IPTPS
2005
Springer
15 years 5 months ago
Locality Prediction for Oblivious Clients
To improve performance, large-scale Internet systems require clients to access nearby servers. While centralized systems can leverage static topology maps for rough network distan...
Kevin P. Shanahan, Michael J. Freedman