We study the problem of learning parity functions that depend on at most k variables (kparities) attribute-efficiently in the mistake-bound model. We design a simple, deterministi...
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
: Multimedia applications nowadays are becoming prevalent. In the past the relational database model was generalized to the multimedia database model. More recently the relational ...
Shi-Kuo Chang, Lei Zhao, Shenoda Guirguis, Rohit K...
We present a mathematical framework for the so-called multidisciplinary free material optimization (MDFMO) problems, a branch of structural optimization in which the full material ...
The paper proposes an integrated framework which uses knowledge representation theory and languages to annotate relevant product information in a semantically rich and unambiguous ...
Michele Ruta, Floriano Scioscia, Eugenio Di Sciasc...