239 search results - page 16 / 48 » Hardness and Algorithms for Rainbow Connectivity |
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
A range-finding scanner can collect information about the shape of an (unknown) polygonal room in which it is placed. Suppose that a set of scanners returns not only a set of poin...
108
click to vote
SAC
2008
ACM
14 years 11 months ago
2008
ACM
Generating adequate recommendations for newcomers is a hard problem for a recommender system (RS) due to lack of detailed user profiles and social preference data. Empirical evide...
ALT
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
117
click to vote
SIGCOMM
2012
ACM
13 years 2 months ago
2012
ACM
We consider a system of compute and storage resources geographically distributed over a large number of locations connected via a wide-area network. By distributing the resources,...
114
click to vote
MOBICOM
2012
ACM
13 years 2 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...