603 search results - page 46 / 121 » A General Approximation Technique for Constrained Forest Pro... |
115
click to vote
TIT
2008
15 years 1 months ago
2008
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...
111
click to vote
WEA
2007
Springer
15 years 7 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
114
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive radio (CR) n...
126
click to vote
ECCC
2000
15 years 1 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
101
Voted
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
We present a modification of “Normalized Cuts” to incorporate priors which can be used for constrained image segmentation. Compared to previous generalizations of “Normaliz...