417 search results - page 42 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
IJCNN
2007
IEEE
14 years 2 months ago
2007
IEEE
– Constructive algorithms are effective methods for designing Artificial Neural Networks (ANN) with good accuracy and generalization capability, yet with parsimonious network str...
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
JC
2008
13 years 8 months ago
2008
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
ESA
2006
Springer
14 years 5 days ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...