243 search results - page 42 / 49 » Linear Network Codes and Systems of Polynomial Equations |
131
click to vote
MOBIHOC
2007
ACM
15 years 11 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
117
click to vote
SIGMETRICS
2008
ACM
14 years 11 months ago
2008
ACM
In this paper, we study the problem of utility maximization in P2P systems, in which aggregate application-specific utilities are maximized by running distributed algorithms on P2...
103
click to vote
SIGIR
2011
ACM
14 years 2 months ago
2011
ACM
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
102
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
DSN
2005
IEEE
15 years 5 months ago
2005
IEEE
In this paper, we present a parallel implementation for the steady-state analysis of continuous-time Markov chains (CTMCs). This analysis is performed via solution of a linear equ...