default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEphraim Feig
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[i2]Ephraim Feig:
A Framework for Blockchain-Based Applications. CoRR abs/1803.00892 (2018)
2000 – 2009
- 2008
- [c18]Tony Shan, Ephraim Feig, Thomas Bui, Jia Zhang:
Smarter SOA. ICWS 2008: 6-7 - [c17]Tony Shan, Ephraim Feig, Thomas Bui, Jia Zhang:
Smarter SOA. SERVICES II 2008: 8-9 - [c16]Liang-Jie Zhang
, Jia Zhang, Ephraim Feig:
Design and Delivery Practices of the Summer School on Services Computing. SERVICES II 2008: 196-200 - [i1]Ephraim Feig, Vivian Feig:
A One-Way Function Based On The Extended Euclidean Algorithm. CoRR abs/0801.2187 (2008) - 2007
- [c15]Ephraim Feig, Liang-Jie Zhang, Ali Arsanjani, Zhiwei Xu:
Services Computing in Action: Services Architectures. ICWS 2007 - 2006
- [c14]Ling Liu, Carl K. Chang, Ephraim Feig, Hemant K. Jain, Liang-Jie Zhang:
Software and Services: Where do they meet? IEEE SCC 2006 - [c13]Pat Narendra, Ephraim Feig, David Heit, Quentin Miller, Timo Burns:
Mobile Web Services Trend Perspectives. IEEE SCC 2006 - 2005
- [c12]Ephraim Feig:
Five Years of Software as a Service: The Good, the Bad and the Ugly. IEEE SCC 2005 - [c11]Ephraim Feig, Ali Arsanjani, Cesar A. Gonzales, Zhiwei Xu:
Experiences with Service Computing - A view from the Business World. IEEE SCC 2005 - [c10]Ephraim Feig:
Five Years of Software as a Service: The Good, the Bad, and the Ugly. ICWS 2005 - [c9]Ephraim Feig:
Experiences with Service Computing--A View from the Business World. ICWS 2005 - 2004
- [c8]Ephraim Feig:
Going Public with Software-as-a-Service. ICWS 2004
1990 – 1999
- 1998
- [j15]Rajesh Rajagopalan, Ephraim Feig, Michael T. Orchard:
Motion optimization of ordered blocks for overlapped block motion compensation. IEEE Trans. Circuits Syst. Video Technol. 8(2): 119-123 (1998) - 1996
- [j14]Lurng-Kuo Liu, Ephraim Feig:
A block-based gradient descent search algorithm for block motion estimation in video coding. IEEE Trans. Circuits Syst. Video Technol. 6(4): 419-422 (1996) - [c7]Fernando C. M. Martins, Wei Ding, Ephraim Feig:
Joint control of spatial quantization and temporal sampling for very low bit rate video. ICASSP 1996: 2072-2075 - 1995
- [j13]Ephraim Feig, Elliot N. Linzer:
Scaled DCT's on input sizes that are composite. IEEE Trans. Signal Process. 43(1): 43-50 (1995) - [c6]Ephraim Feig, Heidi Peterson, Viresh Ratnakar:
Image compression using spatial prediction. ICASSP 1995: 2339-2342 - 1994
- [j12]Bowen Alpern, Larry Carter, Ephraim Feig, Ted Selker:
The Uniform Memory Hierarchy Model of Computation. Algorithmica 12(2/3): 72-109 (1994) - [j11]Don Coppersmith, Ephraim Feig, Elliot N. Linzer:
Hadamard transforms on multiply/add architectures. IEEE Trans. Signal Process. 42(4): 969-970 (1994) - 1993
- [j10]Elliot N. Linzer, Ephraim Feig:
Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures. IEEE Trans. Signal Process. 41(1): 93-107 (1993) - 1992
- [j9]Ephraim Feig, Shmuel Winograd:
On the multiplicative complexity of discrete cosine transforms. IEEE Trans. Inf. Theory 38(4): 1387-1391 (1992) - [j8]Ephraim Feig, Shmuel Winograd:
Fast algorithms for the discrete cosine transform. IEEE Trans. Signal Process. 40(9): 2174-2193 (1992) - 1991
- [c5]Elliot N. Linzer, Ephraim Feig:
New scaled DCT algorithms for fused multiply/add architectures. ICASSP 1991: 2201-2204 - 1990
- [j7]Ephraim Feig:
Practical aspects of DFT-based frequency division multiplexing for data transmission. IEEE Trans. Commun. 38(7): 929-932 (1990) - [j6]Ephraim Feig:
Sequence estimation for class-IV partial-response channels with jitter. IEEE Trans. Commun. 38(8): 1181-1189 (1990) - [c4]Bowen Alpern, Larry Carter, Ephraim Feig:
Uniform Memory Hierarchies. FOCS 1990: 600-608
1980 – 1989
- 1989
- [j5]Ephraim Feig:
Range-Doppler imaging. Int. J. Imaging Syst. Technol. 1(2): 125-131 (1989) - [c3]Ephraim Feig, Fred Mintzer, Arthur Nádas:
Digital implementation of frequency division multiplexing on peak-limited channels. ICASSP 1989: 1364-1367 - 1988
- [j4]Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari:
A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots. SIAM J. Comput. 17(6): 1081-1092 (1988) - 1986
- [c2]Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari:
A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots. STOC 1986: 340-349 - 1983
- [j3]Ephraim Feig:
Minimal Algorithms for Bilinear Forms May Have Divisions. J. Algorithms 4(1): 81-84 (1983) - [j2]Ephraim Feig:
Certain Systems of Bilinear Forms Whose Minimal Algorithms Are All Quadratic. J. Algorithms 4(2): 137-149 (1983) - 1981
- [j1]Ephraim Feig:
On Systems of Bilinear Forms Whose Minimal Division-Free Algorithms Are All Bilinear. J. Algorithms 2(3): 261-281 (1981) - [c1]Ephraim Feig, Shmuel Winograd:
On the Direct Sum Conjecture (Extended Summary). FOCS 1981: 91-94
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-10 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
