865 search results - page 120 / 173 » Random graph models for the web graph |
145
click to vote
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
128
click to vote
CISS
2008
IEEE
2008
IEEE
A lower-bound on the number of rankings required in recommender systems using collaborativ filtering
15 years 10 months ago
— We consider the situation where users rank items from a given set, and each user ranks only a (small) subset of all items. We assume that users can be classified into C classe...
163
click to vote
MOBIHOC
2012
ACM
13 years 6 months ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
146
click to vote
CSE
2009
IEEE
15 years 10 months ago
2009
IEEE
— We examine the social behaviors of game experts in Everquest II, a popular massive multiplayer online role-playing game (MMO). We rely on Exponential Random Graph Models (ERGM)...
141
click to vote
JITECH
2010
15 years 2 months ago
2010
This paper employs the network perspective to study patterns and structures of intraorganizational learning networks. The theoretical background draws from cognitive theories, the...