34 search results - page 6 / 7 » Random inscribing polytopes |
DAM
2000
13 years 5 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
FOCS
2007
IEEE
14 years 2 days ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
WEA
2010
Springer
14 years 17 days ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We consider multiple description (MD) coding for the Gaussian source with K descriptions under the symmetric meansquared error (MSE) distortion constraints, and provide an approxim...
MA
2010
Springer
13 years 4 months ago
2010
Springer
We equip the polytope of n × n Markov matrices with the normalized trace of the Lebesgue measure of Rn2 . This probability space provides random Markov matrices, with i.i.d. rows...