Ephraim Feig - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2008

2007

Services Computing in Action: Services ArchitecturesEphraim Feig, Liang-Jie Zhang, Ali Arsanjani, Zhiwei Xu. icws 2007: [doi]

2006

Software and Services: Where do they meet?Ling Liu, Carl K. Chang, Ephraim Feig, Hemant K. Jain, Liang-Jie Zhang. IEEEscc 2006: [doi]

Mobile Web Services Trend PerspectivesPat Narendra, Ephraim Feig, David Heit, Quentin Miller, Timo Burns. IEEEscc 2006: [doi]

2005

Five Years of Software as a Service: The Good, the Bad and the UglyEphraim Feig. IEEEscc 2005: [doi]

Experiences with Service Computing--A View from the Business WorldEphraim Feig. icws 2005: [doi]

Five Years of Software as a Service: The Good, the Bad, and the UglyEphraim Feig. icws 2005: [doi]

Experiences with Service Computing - A view from the Business WorldEphraim Feig, Ali Arsanjani, Cesar A. Gonzales, Zhiwei Xu. IEEEscc 2005: [doi]

2004

Going Public with Software-as-a-ServiceEphraim Feig. icws 2004: [doi]

1998

Motion optimization of ordered blocks for overlapped block motion compensationRajesh Rajagopalan, Ephraim Feig, Michael T. Orchard. tcsv, 8(2):119-123, 1998. [doi]

1996

A block-based gradient descent search algorithm for block motion estimation in video codingLurng-Kuo Liu, Ephraim Feig. tcsv, 6(4):419-422, 1996. [doi]

Joint control of spatial quantization and temporal sampling for very low bit rate videoFernando C. M. Martins, Wei Ding, Ephraim Feig. icassp 1996: 2072-2075 [doi]

1995

Scaled DCT's on input sizes that are compositeEphraim Feig, Elliot N. Linzer. tsp, 43(1):43-50, 1995. [doi]

Image compression using spatial predictionEphraim Feig, Heidi Peterson, Viresh Ratnakar. icassp 1995: 2339-2342 [doi]

1994

The Uniform Memory Hierarchy Model of ComputationBowen Alpern, Larry Carter, Ephraim Feig, Ted Selker. algorithmica, 12(2/3):72-109, 1994.

Hadamard transforms on multiply/add architecturesDon Coppersmith, Ephraim Feig, Elliot N. Linzer. tsp, 42(4):969-970, 1994. [doi]

1993

Implementation of Efficient FFT Algorithms on Fused Multiply- Add ArchitecturesElliot N. Linzer, Ephraim Feig. tsp, 41(1):93-107, 1993. [doi]

1992

On the multiplicative complexity of discrete cosine transformsEphraim Feig, Shmuel Winograd. TIT, 38(4):1387, 1992.

Fast algorithms for the discrete cosine transformEphraim Feig, Shmuel Winograd. tsp, 40(9):2174-2193, 1992. [doi]

1991

New scaled DCT algorithms for fused multiply/add architecturesElliot N. Linzer, Ephraim Feig. icassp 1991: 2201-2204 [doi]

1990

Uniform Memory HierarchiesBowen Alpern, Larry Carter, Ephraim Feig. focs 1990: 600-608

Sequence estimation for class-IV partial-response channels with jitterEphraim Feig. tcom, 38(8):1181-1189, 1990. [doi]

Practical aspects of DFT-based frequency division multiplexing for data transmissionEphraim Feig. tcom, 38(7):929-932, 1990. [doi]

1989

Range-Doppler imagingEphraim Feig. imst, 1(2):125-131, 1989. [doi]

Digital implementation of frequency division multiplexing on peak-limited channelsEphraim Feig, Fred Mintzer, Arthur Nádas. icassp 1989: 1364-1367 [doi]

1988

A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real RootsMichael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari. SICOMP, 17(6):1081-1092, 1988.

1986

A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real RootsMichael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari. stoc 1986: 340-349

1983

Minimal Algorithms for Bilinear Forms May Have DivisionsEphraim Feig. jal, 4(1):81-84, 1983.

Certain Systems of Bilinear Forms Whose Minimal Algorithms Are All QuadraticEphraim Feig. jal, 4(2):137-149, 1983.

1981

On the Direct Sum Conjecture (Extended Summary)Ephraim Feig, Shmuel Winograd. focs 1981: 91-94

On Systems of Bilinear Forms Whose Minimal Division-Free Algorithms Are All BilinearEphraim Feig. jal, 2(3):261-281, 1981.

Sign in or sign up to see more results.

runs on WebDSL