Abstract. The support vector machine is basically to deal with a two-class classification problem. To get M-class classifiers for face recognition, it is common to construct a set ...
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
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...
We construct a simple public-key encryption scheme that supports polynomially many additions and one multiplication, similar to the cryptosystem of Boneh, Goh, and Nissim (BGN). S...
Software development in general and groupware applications in particular can greatly benefit from the reusability and interoperability aspects associated with software components....