7015 search results - page 220 / 1403 » Approximation algorithms for co-clustering |
192
click to vote
COCOON
2005
Springer
16 years 1 days ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
169
click to vote
COMGEO
2006
ACM
15 years 6 months ago
2006
ACM
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
144
click to vote
TSP
2008
15 years 6 months ago
2008
We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of t...
151
click to vote
COCOON
2005
Springer
16 years 1 days ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
145
click to vote
NIPS
2003
15 years 7 months ago
2003
The maximisation of information transmission over noisy channels is a common, albeit generally computationally difficult problem. We approach the difficulty of computing the mutua...