Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
Non-rigid structure from motion (NR-SFM) is a difficult, underconstrained problem in computer vision. This paper proposes a new algorithm that revises the standard matrix factori...
Abstract. This tutorial explores the design space of heterogeneous synchronization, which is concerned with establishing consistency among artifacts that conform to different sche...
This paper describes our approach of using spatial hypertext as a means separated from an end representation for hypertext authoring. By taking advantage of the power of rich inte...