Sciweavers

518 search results - page 54 / 104
» Beating a Random Assignment
Sort
View
127
Voted
OPODIS
2010
15 years 13 days ago
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
Andreas Larsson, Philippas Tsigas
187
Voted
COR
2011
14 years 9 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
136
Voted
ECCV
2006
Springer
16 years 4 months ago
Smooth Image Segmentation by Nonparametric Bayesian Inference
A nonparametric Bayesian model for histogram clustering is proposed to automatically determine the number of segments when Markov Random Field constraints enforce smooth class assi...
Peter Orbanz, Joachim M. Buhmann
148
Voted
ICPR
2002
IEEE
16 years 3 months ago
Multicue MRF Image Segmentation: Combining Texture and Color Features
Herein, we propose a new Markov random field (MRF) image segmentation model which aims at combining color and texture features. The model has a multi-layer structure: Each feature...
Zoltan Kato, Ting-Chuen Pong, Song Guo Qiang
ICML
2006
IEEE
16 years 3 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke