Sciweavers

3482 search results - page 98 / 697
» In Praise of Numerical Computation
Sort
View
141
Voted
GIAE
2004
Springer
159views Mathematics» more  GIAE 2004»
15 years 6 months ago
A Survey of Moving Frames
This paper surveys the new, algorithmic theory of moving frames developed by the author and M. Fels. Applications in geometry, computer vision, classical invariant theory, the cal...
Peter J. Olver
64
Voted
USS
2008
15 years 2 months ago
Security Benchmarking using Partial Verification
Implementation-level vulnerabilities are a persistent threat to the security of computing systems. We propose using the results of partially-successful verification attempts to pl...
Thomas E. Hart, Marsha Chechik, David Lie
77
Voted
ITA
2008
147views Communications» more  ITA 2008»
15 years 18 days ago
A morphic approach to combinatorial games: the Tribonacci case
We propose a variation of Wythoff's game on three piles of tokens, in the sense that the losing positions can be derived from the Tribonacci word instead of the Fibonacci word...
Éric Duchêne, Michel Rigo
98
Voted
AES
2007
Springer
109views Cryptology» more  AES 2007»
15 years 13 days ago
Compatible coarsening in the multigraph algorithm
We present some heuristics incorporating the philosophy of compatible relaxation into an existing algebraic multigrid method, the so-called multigraph solver of Bank and Smith [1]...
Randolph E. Bank
SAC
2008
ACM
15 years 2 days ago
Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
s: A Weakly Relational Abstract Domain for the Efficient Validation of Array Accesses Francesco Logozzo Microsoft Research, Redmond, WA, USA Manuel F
Francesco Logozzo, Manuel Fähndrich