Sciweavers

9997 search results - page 131 / 2000
» The case for crowd computing
Sort
View
PVM
2010
Springer
14 years 8 months ago
MPI Datatype Marshalling: A Case Study in Datatype Equivalence
MPI datatypes are a convenient abstraction for manipulating complex data structures and are useful in a number of contexts. In some cases, these descriptions need to be preserved o...
Dries Kimpe, David Goodell, Robert B. Ross
DAC
2000
ACM
15 years 11 months ago
To split or to conjoin: the question in image computation
Image computation is the key step in fixpoint computations that are extensively used in model checking. Two techniques have been used for this step: one based on conjunction of the...
In-Ho Moon, James H. Kukula, Kavita Ravi, Fabio So...
ICC
2007
IEEE
15 years 4 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»
14 years 11 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 4 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 ...