4114 search results - page 208 / 823 » Efficient Algorithms for the 2-Center Problems |
159
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
192
click to vote
FUIN
2008
15 years 6 months ago
2008
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
170
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
174
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
First, the covariance matrix adaptation (CMA) with rankone update is introduced into the (1+1)-evolution strategy. An improved implementation of the 1/5-th success rule is propose...
173
click to vote
NIPS
2008
15 years 8 months ago
2008
Bartlett et al (2006) recently proved that a ground condition for convex surrogates, classification calibration, ties up the minimization of the surrogates and classification risk...