Sciweavers

1133 search results - page 97 / 227
» Basics of Graph Cuts
Sort
View
175
Voted
JMLR
2012
13 years 6 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
120
Voted
CVPR
2006
IEEE
16 years 5 months ago
Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
David Tolliver, Gary L. Miller
134
Voted
ICML
2009
IEEE
16 years 4 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
122
Voted
GLOBECOM
2008
IEEE
15 years 10 months ago
A Graph-Based Approach to Multi-Cell OFDMA Downlink Resource Allocation
— A novel, practical and low-complexity multi-cell OFDMA downlink channel assignment method using a graphbased approach is proposed in this work. The inter-cell interference (ICI...
Yu-Jung Chang, Zhifeng Tao, Jinyun Zhang, C. C. Ja...
153
Voted
NOMS
2010
IEEE
195views Communications» more  NOMS 2010»
15 years 1 months ago
Optimized network configuration parameter assignment based on graph coloring
The trend for future mobile networks is to move away from Network Elements (NEs) delivered with specially tailored configurations towards off-the-shelf products. The configurations...
Tobias Bandh, Georg Carle, Henning Sanneck, Lars-C...