19866 search results - page 258 / 3974 » Computing all factorizations in *** |
158
click to vote
IOR
2007
15 years 6 months ago
2007
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
148
click to vote
TPHOL
1996
IEEE
15 years 10 months ago
1996
IEEE
We will present a Logic of Computable Functions based on the idea of Synthetic Domain Theory such that all functions are automatically continuous. Its implementation in the Lego pr...
149
click to vote
NA
2008
15 years 6 months ago
2008
In this paper we address the problem of efficiently computing all the eigenvalues of a large N
154
click to vote
PSIVT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A very compact algorithm is presented for fundamental matrix computation from point correspondences over two images. The computation is based on the strict maximum likeli...
184
click to vote
SIGOPSE
2004
ACM
16 years 2 days ago
2004
ACM
We propose augmenting secure boot with a mechanism to protect against compromises to field-upgradeable devices. In particular, secure boot standards should verify the firmware o...