Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
Arik Motskin, Tim Roughgarden, Primoz Skraba, Leon...
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
—The opening of under-utilized spectrum creates the opportunity of substantial performance improvement through cognitive radio techniques. However, the real network performance m...
Local photometric descriptors are a crucial low level component of numerous computer vision algorithms. In practice, these descriptors are constructed to be invariant to a class o...
Edgar Lobaton, Ramanarayan Vasudevan, Ron Alterovi...