Sciweavers

21324 search results - page 249 / 4265
» Making the case for computing
Sort
View
ICC
2007
IEEE
15 years 10 months ago
Computing Maximum-Likelihood Bounds for Reed-Solomon Codes over Partial Response Channels
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...
Richard M. Todd, J. R. Cruz
ICISC
2004
120views Cryptology» more  ICISC 2004»
15 years 5 months ago
Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
Abstract. We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-andline computation and add-and-line computatio...
Sanjit Chatterjee, Palash Sarkar, Rana Barua
ICSM
2007
IEEE
15 years 10 months ago
Computation of Static Execute After Relation with Applications to Software Maintenance
In this paper, we introduce Static Execute After (SEA) relationship among program components and present an efficient analysis algorithm. Our case studies show that SEA may appro...
Árpád Beszédes, Tamás ...
ICPR
2006
IEEE
16 years 5 months ago
Uncertainties-driven Surface Morphing: The case of Photo-realistic Transitions between Facial Expressions
Reproduction of facial animation play a fundamental role in applications requiring human-computer interactions The objective of this paper is to introduce a geometric mechanism th...
Charlotte Ghys, Maxime Taron, Nikos Paragios
ICPR
2002
IEEE
16 years 5 months ago
Structure in Errors: A Case Study in Fingerprint Verification
Measuring the accuracy of biometrics systems is important. Accuracy estimates depend very much on the quality of the test data that are used. Including poor quality data will degr...
Sharath Pankanti, Nalini K. Ratha, Ruud M. Bolle