Approximation structuring clustering is an extension of what is usually called square-error clustering" onto various cluster structures and data formats. It appears to be not...
Abstract. An approximate Herbrand theorem is established for firstorder infinite-valued Lukasiewicz Logic and used to obtain a proof-theoretic proof of Skolemization. These resul...
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
The paper introduces a new framework for feature learning in classification motivated by information theory. We first systematically study the information structure and present a n...
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...