Sciweavers

131 search results - page 24 / 27
» Colouring Random Regular Graphs
Sort
View
ISAAC
1999
Springer
110views Algorithms» more  ISAAC 1999»
13 years 10 months ago
Online Routing in Triangulations
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
Prosenjit Bose, Pat Morin
VMV
2008
165views Visualization» more  VMV 2008»
13 years 7 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,...
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 4 months ago
Fractional Repetition Codes for Repair in Distributed Storage Systems
Abstract—We introduce a new class of exact MinimumBandwidth Regenerating (MBR) codes for distributed storage systems, characterized by a low-complexity uncoded repair process tha...
Salim Y. El Rouayheb, Kannan Ramchandran
ATAL
2007
Springer
14 years 13 days ago
Emergence of global network property based on multi-agent voting model
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...
Kousuke Shinoda, Yutaka Matsuo, Hideyuki Nakashima
DCG
2006
110views more  DCG 2006»
13 years 6 months ago
High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...
David L. Donoho