Sciweavers

822 search results - page 149 / 165
» Contention in shared memory algorithms
Sort
View
KDD
2009
ACM
229views Data Mining» more  KDD 2009»
14 years 9 months ago
Relational learning via latent social dimensions
Social media such as blogs, Facebook, Flickr, etc., presents data in a network format rather than classical IID distribution. To address the interdependency among data instances, ...
Lei Tang, Huan Liu
IEEEPACT
2009
IEEE
14 years 3 months ago
Soft-OLP: Improving Hardware Cache Performance through Software-Controlled Object-Level Partitioning
—Performance degradation of memory-intensive programs caused by the LRU policy’s inability to handle weaklocality data accesses in the last level cache is increasingly serious ...
Qingda Lu, Jiang Lin, Xiaoning Ding, Zhao Zhang, X...
IPPS
2009
IEEE
14 years 3 months ago
BarterCast: A practical approach to prevent lazy freeriding in P2P networks
A well-known problem in P2P systems is freeriding, where users do not share content if there is no incentive to do so. In this paper, we distinguish lazy freeriders that are merel...
Michel Meulpolder, Johan A. Pouwelse, Dick H. J. E...
WISTP
2007
Springer
14 years 2 months ago
Mobile Phones as Secure Gateways for Message-Based Ubiquitous Communication
Abstract. For ubiquitous communication self-organising adhoc networks become more and more important. We consider mobile phones as appropriate secure gateways to provide access to ...
Walter Bamberger, Oliver Welter, Stephan Spitz
CIKM
2004
Springer
14 years 2 months ago
The robustness of content-based search in hierarchical peer to peer networks
Hierarchical peer to peer networks with multiple directory services are an important architecture for large-scale file sharing due to their effectiveness and efficiency. Recent ...
M. Elena Renda, Jamie Callan