Sciweavers

1493 search results - page 86 / 299
» Local resilience of graphs
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
LION
2009
Springer
203views Optimization» more  LION 2009»
14 years 2 months ago
Position-Guided Tabu Search Algorithm for the Graph Coloring Problem
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
ICPR
2008
IEEE
14 years 2 months ago
Video denoising via discrete regularization on graphs
We present local and nonlocal algorithms for video denoising based on discrete regularization on graphs. The main difference between video and image denoising is the temporal redu...
Mahmoud Ghoniem, Youssef Chahir, Abderrahim Elmoat...
ECCV
2010
Springer
14 years 1 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
DCC
2010
IEEE
14 years 29 days ago
Tanner Graph Based Image Interpolation
This paper interprets image interpolation as a channel decoding problem and proposes a tanner graph based interpolation framework, which regards each pixel in an image as a variab...
Ruiqin Xiong, Wen Gao