There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
Edward R. Dougherty, Junior Barrera, Marcel Brun, ...
The old problem of managing the history of database information is now made more urgent and complex by fast spreading web information systems, such as Wikipedia. Our PRIMA system ...
Hyun Jin Moon, Carlo Curino, Alin Deutsch, Chien-Y...
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
When building scalable systems that involve general-purpose computation and persistent data, object-oriented languages and relational databases are often essential components. Yet...
This work deals with the application of kernel methods to structured relational settings such as semantic knowledge bases expressed in Description Logics. Our method integrates a n...