6299 search results - page 1258 / 1260 » Data and Computation Abstractions for Dynamic and Irregular ... |
SIAMCO
2010
13 years 2 months ago
2010
Abstract. In the paper compressible, stationary Navier-Stokes (N-S) equations are considered. The model is well-posed, there exist weak solutions in bounded domains, subject to inh...
SIAMMAX
2010
13 years 2 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
TWC
2010
13 years 2 months ago
2010
Abstract--In this paper, we deal with the performance of nonorthogonal Amplify-and-Forward protocols over block-fading channels (BFNAF), where the source retransmits the same data ...
CGO
2011
IEEE
12 years 11 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—Computer systems are increasingly driven by workloads that reflect large-scale social behavior, such as rapid changes in the popularity of media items like videos. Capa...