Sciweavers

972 search results - page 60 / 195
» Performance of data networks with random links
Sort
View
IPSN
2003
Springer
15 years 11 months ago
A Robust Data Delivery Protocol for Large Scale Sensor Networks
Although data forwarding algorithms and protocols have been among the first set of issues explored in sensor networking, how to reliably deliver sensing data through a vast field...
Fan Ye, Gary Zhong, Songwu Lu, Lixia Zhang
SDMW
2004
Springer
15 years 11 months ago
Using Secret Sharing for Searching in Encrypted Data
When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the...
Richard Brinkman, Jeroen Doumen, Willem Jonker
KDD
2009
ACM
162views Data Mining» more  KDD 2009»
16 years 6 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
TMC
2008
210views more  TMC 2008»
15 years 5 months ago
Adaptive Cluster-Based Data Collection in Sensor Networks with Direct Sink Access
Recently wireless sensor networks featuring direct sink access have been studied as an efficient architecture to gather and process data for numerous applications. In this paper, w...
Mahdi Lotfinezhad, Ben Liang, Elvino S. Sousa
IWQOS
2005
Springer
15 years 11 months ago
Processor Sharing Flows in the Internet
Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and pr...
Nandita Dukkipati, Masayoshi Kobayashi, Rui Zhang-...