DZ
DefZone.Net

Kien thuc cong nghe & giai tri

Wiki Article

Boris Yamnitsky

Nguồn dữ liệu từ Wikipedia, hiển thị bởi DefZone.Net

Xem trên WikipediaBài ngẫu nhiên khác
Boris Yamnitsky
Born
Soviet Union
Alma materBoston University
OccupationsComputer scientist, researcher, software developer
Known forBoris FX (founder)
Websitewww.borisfx.com

Boris Yamnitsky is a Soviet-American computer scientist, researcher, and software developer. He is the founder of Boris FX, a company that develops software for visual effects and compositing. He co-authored a polynomial-time algorithm for linear programming with Leonid A. Levin.

Early life and education

[edit]

Yamnitsky emigrated from the former Soviet Union in the 1970s.[1] He earned an M.A. in Mathematics from Boston University in 1982, where he studied theoretical computer science and linear programming.[1][2]

Research and career

[edit]

In 1982, Yamnitsky co-authored a paper with Leonid A. Levin titled "An Old Linear Programming Algorithm Runs in Polynomial Time".[3][4] The paper introduced an n-dimensional simplex-splitting technique, known as the Yamnitsky–Levin algorithm. The authors demonstrated that the number of splits required, denoted q(n), equals 1, which establishes polynomial-time behavior under certain conditions.[2][5][6] The algorithm has been cited in studies on convex optimization, approximation algorithms, and linear programming methods.[7][6][8][9] Yamnitsky documented the algorithm in his Master’s thesis.[2]

Yamnitsky founded Boris FX in 1995 to develop software for visual effects, compositing, and post-production.[10][11] He oversaw the development of software tools incorporating machine learning and AI for rotoscoping, object detection, motion estimation, image restoration, and audio denoising.[12][13]

Awards and recognition

[edit]
  • 2017: Digital Video Industry Innovator Award from NewBay Media[14]
  • 2019: Engineering Emmy Awards for Sapphire, Mocha Pro, and Silhouette[15]
  • 2025: Engineering, Science & Technology Emmy Award for Continuum[16][17][18][19][20][21]

Selected publications

[edit]

References

[edit]
  1. ^ a b "GTC Program Guide" (PDF). NVIDIA. Retrieved 2025-12-08.
  2. ^ a b c "An Old Linear Programming Algorithm Runs in Polynomial Time" (PDF). Boston University. Retrieved 2025-12-08.
  3. ^ "An old linear programming algorithm runs in polynomial time". www.computer.org. Retrieved 2025-12-08.
  4. ^ Yamnitsky, Boris; Levin, Leonid A. (1982). "An Old Linear Programming Algorithm Runs in Polynomial Time". 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982). pp. 327–328. doi:10.1109/SFCS.1982.63. S2CID 25758232.
  5. ^ a b Yamnitsky, Boris; Levin, Leonid A. (1982). "An old linear programming algorithm runs in polynomial time". 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982). pp. 327–328. doi:10.1109/SFCS.1982.63.
  6. ^ a b Bartels, Sven G. (2000), Kalai, Gil; Ziegler, Günter M. (eds.), "The Complexity of Yamnitsky and Levin's Simplices Algorithm", Polytopes — Combinatorics and Computation, Basel: Birkhäuser, pp. 199–225, doi:10.1007/978-3-0348-8438-9_10, ISBN 978-3-0348-8438-9, retrieved 2025-11-20{{citation}}: CS1 maint: work parameter with ISBN (link)
  7. ^ "A brief history of NP-completeness, 1954–2012". ResearchGate. Retrieved 2025-12-08.
  8. ^ Chvátal, Vašek (1983-09-15). Linear Programming. Macmillan. ISBN 978-0-7167-1587-0.
  9. ^ Faigle, U.; Hunting, M.; Kern, W.; Prakash, R.; Supowit, K. J. (1997-02-01). "Simplices by point-sliding and the Yamnitsky-Levin algorithm". Mathematical Methods of Operations Research. 46 (1): 131–142. doi:10.1007/BF01199467. ISSN 1432-5217.
  10. ^ "BorisFX founder Boris Yamnitsky shares his vision of the future of AI". Retrieved 2025-12-08.
  11. ^ "Boris goes to Hollywood". 1997-08-11. Retrieved 2025-12-08.
  12. ^ "Boris FX Continuum Adds New AI VFX Tools". Animation World Network. Retrieved 2025-12-08.
  13. ^ "Boris FX Continues Expansion of Visual Effects Tools". October 9, 2019. Retrieved 2025-12-08.
  14. ^ "Boris FX Founder Honored with a Digital Video Industry Innovator Award". Retrieved 2025-12-08.
  15. ^ "Boris FX Wins Big at Engineering Emmy Awards". Retrieved 2025-12-08.
  16. ^ Electa Petrov, Jessie. "Boris FX Continuum Honored with 2025 Engineering, Science & Technology Emmy® Award". Retrieved 2025-12-08.
  17. ^ "77th Engineering, Science & Technology Emmy Awards". Television Academy. Retrieved 2025-12-08.
  18. ^ Schneider, Michael (2025-09-02). "TV Academy Announces Engineering, Science & Technology Emmy Award Winners". Variety. Retrieved 2025-12-08.
  19. ^ "2025 ENGINEERING, SCIENCE & TECHNOLOGY EMMYS". Retrieved 2025-12-08.
  20. ^ Corrigan, Matthew (2025-09-03). "BBC Research and Development awarded Engineering, Science and Technology Emmy". TVBEurope. Retrieved 2025-12-08.
  21. ^ "Congratulations to Boris FX for their 2025 Emmy® Win! -". 2025-09-11. Retrieved 2025-12-08.
  22. ^ Yamnitsky, Boris; Levin, Leonid A. (1982). "An Old Linear Programming Algorithm Runs in Polynomial Time". www.computer.org. IEEE: 327–328. doi:10.1109/SFCS.1982.63. Retrieved 2025-12-08.
  23. ^ Yamnitsky, Boris; Levin, Leonid A. (November 1982). "An old linear programming algorithm runs in polynomial time". 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982): 327–328. doi:10.1109/SFCS.1982.63.