8499 search results - page 76 / 1700 » cans 2009 |
93
Voted
FM
2009
Springer
15 years 7 months ago
2009
Springer
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
95
Voted
IFIP
2009
Springer
15 years 7 months ago
2009
Springer
We consider the problem of detecting covert channels within security-enforcing object-capability patterns. Traditional formalisms for reasoning about the security properties of obj...
84
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
— In order to reduce the computational load of the recursive least squares (RLS) algorithm, a decomposition based least squares algorithm is developed for non-uniformly sampled m...
106
Voted
ATMOS
2009
15 years 1 months ago
2009
Abstract. Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several...
89
Voted
LATINCRYPT
2010
14 years 11 months ago
2010
Let E be a non-supersingular elliptic curve over a finite field Fq. At CRYPTO 2009, Icart introduced a deterministic function Fq → E(Fq) which can be computed efficiently, and ...