—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. ...
In this paper, a fast adaptive neural network classifier named FANNC is proposed. FANNC exploits the advantages of both adaptive resonance theory and field theory. It needs only on...
Abstract. In this paper we initiate an exploration of relationships between “preference elicitation”, a learning-style problem that arises in combinatorial auctions, and the pr...
Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, M...
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...