Output-sensitive construction of the union of trianglesEZRA, Esther; SHARIR, Micha.SIAM journal on computing (Print). 2005, Vol 34, Num 6, pp 1331-1351, issn 0097-5397, 21 p.Article

The VC dimension of k-fold unionEISENSTAT, David; ANGLUIN, Dana.Information processing letters. 2007, Vol 101, Num 5, pp 181-184, issn 0020-0190, 4 p.Article

Two refinements of the bound of Sauer, Perles and Shelah, and of Vapnik and ChervonenkisANSTEE, R. P; FLEMING, Balin.Discrete mathematics. 2010, Vol 310, Num 23, pp 3318-3323, issn 0012-365X, 6 p.Article

On ordinal VC-dimension and some notions of complexityMARTIN, Eric; SHARMA, Arun; STEPHAN, Frank et al.Theoretical computer science. 2006, Vol 364, Num 1, pp 62-76, issn 0304-3975, 15 p.Conference Paper

Vapnik-Chervonenkis dimensions bounds for two- and three-layer networksBARTLETT, P. L.Neural computation. 1993, Vol 5, Num 3, pp 371-373, issn 0899-7667Article

Hints and the VC dimensionABU-MOSTAFA, Y. S.Neural computation. 1993, Vol 5, Num 2, pp 278-288, issn 0899-7667Article

Neural nets with superlinear VC-dimensionMAASS, W.Neural computation. 1994, Vol 6, Num 5, pp 877-884, issn 0899-7667Article

On the learnability of recursive dataHAMMER, B.MCSS. Mathematics of control, signals and systems. 1999, Vol 12, Num 1, pp 62-79, issn 0932-4194Article

An improved lower bound on query complexity for quantum PAC learningCHI ZHANG.Information processing letters. 2010, Vol 111, Num 1, pp 40-45, issn 0020-0190, 6 p.Article

k-Fold unions of low-dimensional concept classesEISENSTAT, David.Information processing letters. 2009, Vol 109, Num 23-24, pp 1232-1234, issn 0020-0190, 3 p.Article

Forbidden configurations and repeated inductionANSTEE, R. P; MEEHAN, C. G. W.Discrete mathematics. 2011, Vol 311, Num 20, pp 2187-2197, issn 0012-365X, 11 p.Article

On the complexity of constrained VC-classesRATSABY, Joel.Discrete applied mathematics. 2008, Vol 156, Num 6, pp 903-910, issn 0166-218X, 8 p.Article

Neural networks with local receptive fields and superlinear VC dimensionSCHMITT, Michael.Neural computation. 2002, Vol 14, Num 4, pp 919-956, issn 0899-7667Article

Hitting sets when the VC-dimension is smallEVEN, Guy; RAWITZ, Dror; SHAHAR, Shimon et al.Information processing letters. 2005, Vol 95, Num 2, pp 358-362, issn 0020-0190, 5 p.Article

On the transversal number and VC-dimension of families of positive homothets of a convex bodyNASZODI, Márton; TASCHUK, Steven.Discrete mathematics. 2010, Vol 310, Num 1, pp 77-82, issn 0012-365X, 6 p.Article

NETWORK FAILURE DETECTION AND GRAPH CONNECTIVITYKLEINBERG, Jon; SANDLER, Mark; SLIVKINS, Aleksandrs et al.SIAM journal on computing (Print). 2009, Vol 38, Num 4, pp 1330-1346, issn 0097-5397, 17 p.Article

Efficient NC algorithms for set cover with applications to learning and geometryBERGER, B; ROMPEL, J; SHOR, P. W et al.Journal of computer and system sciences (Print). 1994, Vol 49, Num 3, pp 454-477, issn 0022-0000Article

Estimates of storage capacity of multilayer perceptron with threshold logic hidden unitsKOWALCZYK, A.Neural networks. 1997, Vol 10, Num 8, pp 1417-1433, issn 0893-6080Article

The VC dimension of constraint-based grammars = La dimension VC des grammaires basées sur la contrainteBANE, Max; RIGGLE, Jason; SONDEREGGER, Morgan et al.Lingua (Haarlem. Print). 2010, Vol 120, Num 5, pp 1194-1208, issn 0024-3841, 15 p.Article

Model selection in demographic time series using VC-boundsCORANI, Giorgio; GATTO, Marino.Ecological modelling. 2006, Vol 191, Num 1, pp 186-195, issn 0304-3800, 10 p.Conference Paper

Measuring the VC-dimension of a learning machineVAPNIK, V; LEVIN, E; LE CUN, Y et al.Neural computation. 1994, Vol 6, Num 5, pp 851-876, issn 0899-7667Article

VC-dimension and structural risk minimization for the analysis of nonlinear ecological modelsCORANI, Giorgio; GATTO, Marino.Applied mathematics and computation. 2006, Vol 176, Num 1, pp 166-176, issn 0096-3003, 11 p.Article

Active sampling for multiple output identificationFINE, Shai; MANSOUR, Yishay.Machine learning. 2007, Vol 69, Num 2-3, pp 213-228, issn 0885-6125, 16 p.Conference Paper

A notion of task relatedness yielding provable multiple-task learning guaranteesBEN-DAVID, Shai; SCHULLER BORBELY, Reba.Machine learning. 2008, Vol 73, Num 3, pp 273-287, issn 0885-6125, 15 p.Article

Kolmogorov complexity and combinatorial methods in communication complexityKAPLAN, Marc; LAPLANTE, Sophie.Theoretical computer science. 2011, Vol 412, Num 23, pp 2524-2535, issn 0304-3975, 12 p.Article