Sciweavers

160 search results - page 11 / 32
» A spectral approach to bandwidth and separator problems in g...
Sort
View
ICCV
2003
IEEE
14 years 9 months ago
Multiclass Spectral Clustering
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
Stella X. Yu, Jianbo Shi
UAI
2003
13 years 9 months ago
Learning Generative Models of Similarity Matrices
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
Rómer Rosales, Brendan J. Frey
IAT
2005
IEEE
14 years 1 months ago
Decomposition Techniques for a Loosely-Coupled Resource Allocation Problem
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
ICC
2009
IEEE
157views Communications» more  ICC 2009»
14 years 2 months ago
A Graph Approach to Dynamic Fractional Frequency Reuse (FFR) in Multi-Cell OFDMA Networks
A graph-based framework for dynamic fractional frequency reuse (FFR) in multi-cell OFDMA networks is proposed in this work. FFR is a promising resource allocation technique that c...
Ronald Chang, Zhifeng Tao, Jinyun Zhang, C.-C. Jay...
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 1 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan