In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
This paper proposes a model for Information Retrieval (IR) based on possibilistic directed networks. Relations documents-terms and query-terms are modeled through possibility and n...
We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of...
Michele Boreale, Maria Grazia Buscemi, Ugo Montana...
The goal of this project was to determine if advanced rendering methods such as global illumination allow more accurate discrimination of shape differences than standard rendering...
James A. Ferwerda, Stephen H. Westin, Randall C. S...
Web image search engine has become an important tool to organize digital images on the Web. However, most commercial search engines still use a list presentation while little effo...