Abstract. We compose a toolbox for the design of Minimum Disagreement algorithms. This box contains general procedures which transform (without much loss of efficiency) algorithms ...
Deterministic finite automata (DFA) have long served as a fundamental computational model in the study of theoretical computer science, and the problem of learning a DFA from give...
We consider a problem of learning kernels for use in SVM classification in the multi-task and lifelong scenarios and provide generalization bounds on the error of a large margin c...
Abstract. We study an interactive model of supervised clustering introduced by Balcan and Blum [6], where the clustering algorithm has query access to a teacher. We give an efficie...
We design algorithms for online linear optimization that have optimal regret and at the same time do not need to know any upper or lower bounds on the norm of the loss vectors. We ...
We study the optimal rates of convergence for estimating a prior distribution over a VC class from a sequence of independent data sets respectively labeled by independent target f...
—After four years of development of the Image Processing On Line journal (IPOL), this article presents a first analysis and overview of its scientific and technical development...
Miguel Colom, Bertrand Kerautret, Nicolas Limare, ...
—In the midst of environmental concerns, and soaring energy costs and energy shortages, the efficiency of electrical household water heaters (EWHs) has been identified as an ar...
P. J. C. Nel, M. J. Thinus Booysen, B. van der Mer...
— In this paper, three pricing scenarios are proposed to set the transaction cost of the inter-operators agreement in a multi-operator cooperative environment. An analysis, of th...
Soha Farhat, Abed Ellatif Samhat, Samer Lahoud, Be...