Sciweavers

118 search results - page 4 / 24
» Performance of random walks in one-hop replication networks
Sort
View
ICDCS
2007
IEEE
14 years 2 months ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta
CCR
2008
112views more  CCR 2008»
13 years 8 months ago
Empirical evaluation of querying mechanisms for unstructured wireless sensor networks
In the last few years, several studies have analyzed the performance of flooding and random walks as querying mechanisms for unstructured wireless sensor networks. However, most o...
Joon Ahn, Shyam Kapadia, Sundeep Pattem, Avinash S...
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
14 years 3 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer
KDD
2009
ACM
162views Data Mining» more  KDD 2009»
14 years 9 months ago
TrustWalker: a random walk model for combining trust-based and item-based recommendation
Collaborative filtering is the most popular approach to build recommender systems and has been successfully employed in many applications. However, it cannot make recommendations ...
Mohsen Jamali, Martin Ester
INFOCOM
2006
IEEE
14 years 2 months ago
Performance of Full Text Search in Structured and Unstructured Peer-to-Peer Systems
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
Yong Yang, Rocky Dunlap, Mike Rexroad, Brian F. Co...