Sciweavers

4435 search results - page 525 / 887
» Algorithms, games, and the internet
Sort
View
150
Voted
WWW
2010
ACM
15 years 7 months ago
SNDocRank: document ranking based on social networks
To improve the search results for socially-connect users, we propose a ranking framework, Social Network Document Rank (SNDocRank). This framework considers both document contents...
Liang Gou, Hung-Hsuan Chen, Jung-Hyun Kim, Xiaolon...
199
Voted
WWW
2010
ACM
15 years 7 months ago
LINKREC: a unified framework for link recommendation with user attributes and graph structure
With the phenomenal success of networking sites (e.g., Facebook, Twitter and LinkedIn), social networks have drawn substantial attention. On online social networking sites, link r...
Zhijun Yin, Manish Gupta, Tim Weninger, Jiawei Han
185
Voted
CN
2007
135views more  CN 2007»
15 years 6 months ago
Handling feature interactions in the language for end system services
Since traditional telecommunication networks assume dumb terminals, there are rarely feature interactions involving end systems. However, in Internet telephony systems, such featur...
Xiaotao Wu, Henning Schulzrinne
COMCOM
2007
99views more  COMCOM 2007»
15 years 6 months ago
Topology-aware overlay path probing
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as O(n2 ), which is prohibitive in large-scale...
Chiping Tang, Philip K. McKinley
175
Voted
JACM
2007
121views more  JACM 2007»
15 years 6 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...