Sciweavers

IPL
2011
73views more  IPL 2011»
12 years 11 months ago
Maximum subset intersection
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . ...
Raphaël Clifford, Alexandru Popa
IPL
2011
88views more  IPL 2011»
12 years 11 months ago
Smooth movement and Manhattan path based Random Waypoint mobility
In this paper, we study the stationary node distribution of a variation of the Random Waypoint mobility model, in which nodes move in a smooth way following one randomly chosen Ma...
Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Do...
IPL
2011
74views more  IPL 2011»
12 years 11 months ago
Computing simple-path convex hulls in hypergraphs
Francesco M. Malvestuto, Mauro Mezzini, Marina Mos...