Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
This paper studies mobile-generated traffic distributions in mobile ATM networks and evaluates the performance of path rerouting algorithms for handoff control. In mobile ATM netwo...
This paper summarizes value analysis of adopting technologysupported attendance control service in a primary school. The results are based on a case study that explored a 14-week ...
Minna Isomursu, Mari Ervasti, Marianne Kinnula, Pe...
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...