Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Ephraim Feig"'
Publikováno v:
2016 IEEE International Conference on Web Services (ICWS).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42e3d8f48fcc880d008fa331dd50d120
https://doi.org/10.1109/icws.2016.5
https://doi.org/10.1109/icws.2016.5
Publikováno v:
2014 IEEE 7th International Conference on Cloud Computing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0a82061ea999cf5b3cb89234eacb5c2
https://doi.org/10.1109/cloud.2014.5
https://doi.org/10.1109/cloud.2014.5
Autor:
Ephraim Feig, Michael Ben-Or
Publikováno v:
Linear Algebra and its Applications. 266:81-106
An algebraic theory for the discrete cosine transform (DCT) is developed, which is analogous to the well-known theory of the discrete Fourier transform (DFT). Whereas the latter diagonalizes a convolution algebra, which is a polynomial algebra modulo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::26f1032c89b372be440c13b98cfac919
Autor:
Ephraim Feig, E. Linter
Publikováno v:
IEEE Transactions on Signal Processing. 43:43-50
Given efficient scaled discrete cosine transforms (DCT's) of size p and q, where p and q are relatively prime, we present methods for constructing fast algorithms to compute scaled DCT's and scaled inverse DCT's of size pq. Extensions to multidimensi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::424552ea6ae5a52c637b7ffd3a9a4793
https://doi.org/10.1109/78.365284
https://doi.org/10.1109/78.365284
Publikováno v:
2012 IEEE First International Conference on Mobile Services.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c28099859b8f3bd14ed63afa0544314
https://doi.org/10.1109/mobserv.2012.4
https://doi.org/10.1109/mobserv.2012.4
Publikováno v:
2012 IEEE Fifth International Conference on Cloud Computing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::051d3f4198dfbc15f6b9dc563169e589
https://doi.org/10.1109/cloud.2012.4
https://doi.org/10.1109/cloud.2012.4
Publikováno v:
Algorithmica. 12:72-109
TheUniform Memory Hierarchy (UMH) model introduced in this paper captures performance-relevant aspects of the hierarchical nature of computer memory. It is used to quantify architectural requirements of several algorithms and to ratify the faster spe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0bebaaa7504079ec03adf4840d81cd10
https://doi.org/10.1007/bf01185206
https://doi.org/10.1007/bf01185206
Autor:
Elliot Linzer, Ephraim Feig
Publikováno v:
Mathematics of Computation. 60:347-361
We introduce fast Fourier transform algorithms (FFTs) designed for fused multiply-add architectures. We show how to compute a complex discrete Fourier transform (DFT) of length n = 2 m n = {2^m} with 8 3 n m − 16 9 n + 2 − 2 9 ( − 1 ) m \frac {
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3cde69c3047fab26bbdcfae0fd988802
https://doi.org/10.1090/s0025-5718-1993-1159169-0
https://doi.org/10.1090/s0025-5718-1993-1159169-0
Publikováno v:
2010 6th World Congress on Services.
SERVICES 2010 is in its sixth year and its theme is modernization of the services industry. This congress emphasizes the science and technology of modernizing services industries with latest methods and technologies, including the services, cloud com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d527e91897b4daacd5fda0a6721a557
https://doi.org/10.1109/services.2010.4
https://doi.org/10.1109/services.2010.4
Autor:
Ephraim Feig, Elliot Linzer
Publikováno v:
Advances in Applied Mathematics. 13:494-503
We obtain the multiplicative complexity of discrete cosine transforms in all cases. It is given as a function of the multiplicative complexity of discrete Fourier transforms. The latter have all been determined previously.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::738ed6f856db50de0e0bec333e9c3f68
https://doi.org/10.1016/0196-8858(92)90023-p
https://doi.org/10.1016/0196-8858(92)90023-p