Search for Author All Reviews
	Rabinovich, Michael     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 4 of 4 reviews        Discrete geodesic nets for modeling developable surfaces Rabinovich M., Hoffmann T., Sorkine-Hornung O. ACM Transactions on Graphics (TOG) 37(2): 1-17, 2018.  Type: Article Developable surfaces are those that can be flattened to the plane isometrically, that is, without stretching or tearing. They play an important role in manufacturing and architecture, for example, curved glass can be constructed by rol...... Feb 25 2020     DHTTP: an efficient and cache-friendly transfer protocol for the Web Rabinovich M., Wang H. IEEE/ACM Transactions on Networking 12(6): 1007-1020, 2004.  Type: Article Dual-transport hypertext transfer protocol (DHTTP) is a new type of Internet protocol. It is more efficient, and does not violate the end-to-end principle of the Internet in the presence of interception Web proxies. This paper describe...... May 10 2005     Web caching and replication Rabinovich M., Spatscheck O., Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2002. 361 pp.  Type: Book (9780201615708), Reviews: (2 of 2) Web technologies represent one of the fastest growing fields of IT over the last decade. This is because Web technologies are applicable to almost every aspect of human life, and not merely to IT specialists. Textbooks covering these ...... Dec 5 2002     Web caching and replication Rabinovich M., Spatscheck O., Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2002. 361 pp.  Type: Book (9780201615708), Reviews: (1 of 2) The phenomenal growth of the Web and Internet networking over the last several years has created a new problem for IT professionals: how to enable Web servers to keep up with the content demands of a rapidly increasing user population...... Jul 24 2002
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy