Sciweavers

458 search results - page 59 / 92
» Totally magic graphs
Sort
View
SPDP
1991
IEEE
13 years 11 months ago
Asynchronous parallel search by the parallel genetic algorithm
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
Heinz Mühlenbein
VMV
2008
165views Visualization» more  VMV 2008»
13 years 9 months ago
Fast Global Labeling for Real-Time Stereo Using Multiple Plane Sweeps
This work presents a real-time, data-parallel approach for global label assignment on regular grids. The labels are selected according to a Markov random field energy with a Potts...
Christopher Zach, David Gallup, Jan-Michael Frahm,...
AAAI
2004
13 years 9 months ago
Shortest Path Discovery Problems: A Framework, Algorithms and Experimental Results
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
Csaba Szepesvári
SODA
2004
ACM
120views Algorithms» more  SODA 2004»
13 years 9 months ago
Optimal routing in Chord
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
Prasanna Ganesan, Gurmeet Singh Manku
ICASSP
2010
IEEE
13 years 7 months ago
Graph-based regularization for spherical signal interpolation
This paper addresses the problem of the interpolation of 2-d spherical signals from non-uniformly sampled and noisy data. We propose a graph-based regularization algorithm to impr...
Tamara Tosic, Tamara Frossard