Sciweavers

867 search results - page 7 / 174
» Network Robustness and Graph Topology
Sort
View
EDBT
2006
ACM
159views Database» more  EDBT 2006»
15 years 9 months ago
Fast Nearest Neighbor Search on Road Networks
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...
Haibo Hu, Dik Lun Lee, Jianliang Xu
INFOCOM
2009
IEEE
15 years 4 months ago
Lightweight Coloring and Desynchronization for Networks
—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...
CVPR
2000
IEEE
15 years 11 months ago
Robust and Efficient Skeletal Graphs
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 ...
Pavel Dimitrov, Carlos Phillips, Kaleem Siddiqi
100
Voted
INFOCOM
2012
IEEE
13 years 1 days ago
Robust topology control in multi-hop cognitive radio networks
—The opening of under-utilized spectrum creates the opportunity of substantial performance improvement through cognitive radio techniques. However, the real network performance m...
Jing Zhao, Guohong Cao
ICCV
2011
IEEE
13 years 9 months ago
Robust Topological Features for Deformation Invariant Image Matching
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...