1274 search results - page 145 / 255 » New Proofs for |
174
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
The problem of minimizing the rank of a matrix subject to linear equality constraints arises in applications in machine learning, dimensionality reduction, and control theory, and...
149
click to vote
DISOPT
2008
15 years 6 months ago
2008
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
138
click to vote
ENTCS
2008
15 years 6 months ago
2008
The interactive theorem prover developed in the KeY project, which implements a sequent calculus for JavaCard Dynamic Logic (JavaCardDL) is based on taclets. Taclets are lightweig...
146
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's...
126
click to vote
DCG
2006
15 years 5 months ago
2006
We introduce a new encoding of the face numbers of a simplicial complex, its Stirling polynomial, that has a simple expression obtained by multiplying each face number with an app...