Sciweavers

296 search results - page 3 / 60
» Bipartite Graphs as Models of Complex Networks
Sort
View
INCDM
2007
Springer
121views Data Mining» more  INCDM 2007»
13 years 12 months ago
Collaborative Filtering Using Electrical Resistance Network Models
Abstract. In a recommender system where users rate items we predict the rating of items users have not rated. We define a rating graph containing users and items as vertices and r...
Jérôme Kunegis, Stephan Schmidt
SSS
2010
Springer
158views Control Systems» more  SSS 2010»
13 years 4 months ago
Low Memory Distributed Protocols for 2-Coloring
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
14 years 8 days ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
NOMS
2002
IEEE
130views Communications» more  NOMS 2002»
13 years 10 months ago
End-to-end service failure diagnosis using belief networks
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
Malgorzata Steinder, Adarshpal S. Sethi
WG
2004
Springer
13 years 11 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...