Sciweavers

2310 search results - page 178 / 462
» Coloring Random Graphs
Sort
View
CN
2007
154views more  CN 2007»
15 years 2 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
TIT
2002
146views more  TIT 2002»
15 years 2 months ago
Least squares estimation of 2-D sinusoids in colored noise: Asymptotic analysis
This paper considers the problem of estimating the parameters of real-valued two-dimensional (2-D) sinusoidal signals observed in colored noise. This problem is a special case of t...
Guy Cohen, Joseph M. Francos
PAMI
2010
215views more  PAMI 2010»
15 years 26 days ago
Fusion Moves for Markov Random Field Optimization
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
Victor S. Lempitsky, Carsten Rother, Stefan Roth, ...
IVC
2008
141views more  IVC 2008»
15 years 1 months ago
Segmentation of color images via reversible jump MCMC sampling
Reversible jump Markov chain Monte Carlo (RJMCMC) is a recent method which makes it possible to construct reversible Markov chain samplers that jump between parameter subspaces of...
Zoltan Kato
124
Voted
MICCAI
2008
Springer
16 years 3 months ago
Weights and Topology: A Study of the Effects of Graph Construction on 3D Image Segmentation
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...
Leo Grady, Marie-Pierre Jolly