Conference paper
Social networks and discovery in the enterprise (SaND)
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
We show that there are algorithms which find an approximate zero of a system of polynomial equations and which function in polynomial time on the average. The number of arithmetic operations is cN4s, where N is the input size and c a universal constant. © 1994.
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Robert E. Donovan
INTERSPEECH - Eurospeech 2001