Sciweavers

2018 search results - page 196 / 404
» Magnitude-preserving ranking algorithms
Sort
View
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
16 years 6 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
ICDCS
2006
IEEE
16 years 15 days ago
Search-and-Discover in Mobile P2P Network Databases
In this paper we propose a novel algorithm called Rank-Based Broadcast (RBB) for discovery of local resources in mobile P2P networks. With RBB, each moving object periodically bro...
Ouri Wolfson, Bo Xu, Huabei Yin, Hu Cao
ICALP
1992
Springer
15 years 10 months ago
Fast Integer Merging on the EREW PRAM
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
Torben Hagerup
AIRWEB
2007
Springer
15 years 10 months ago
Measuring Similarity to Detect Qualified Links
The early success of link-based ranking algorithms was predicated on the assumption that links imply merit of the target pages. However, today many links exist for purposes other ...
Xiaoguang Qi, Lan Nie, Brian D. Davison
AOSD
2007
ACM
15 years 10 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen