1996 search results - page 109 / 400 » Financial Theory 2 |
121
click to vote
JDA
2008
15 years 4 months ago
2008
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...
307
click to vote
JMIV
2007
15 years 4 months ago
2007
In [2], Chambolle proposed an algorithm for minimizing the total variation of an image. In this short note, based on the theory on semismooth operators, we study semismooth Newton...
MLQ
1998
15 years 3 months ago
1998
This paper presents a new method – which does not rely on the cut-elimination theorem – for characterizing the provably total functions of certain intuitionistic subsystems of ...
146
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
TIT
1998
15 years 3 months ago
1998
We explore some basic properties of coding theory of a general quantum communication channel and its operational capacity, including (1) adaptive measurement with feedback code, (...