Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
Although lots of works have been engaged in interactive and realistic rendering of translucent materials, efficient processing for deformable models remains a challenging problem...
Yi Gong, Wei Chen, Long Zhang, Yun Zeng, Qunsheng ...
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of ...
Flavio Antonio Ferrarotti, Jose Maria Turull Torre...
Current rights management systems are not able to enforce copyright laws because of both legal and technological reasons. The contract rights granted by a copyright owner are often...
Cheun Ngen Chong, Sandro Etalle, Pieter H. Hartel,...