16188 search results - page 355 / 3238 » The Optimal PAC Algorithm |
182
Voted
IJON
2000
15 years 6 months ago
2000
A general problem in model selection is to obtain the right parameters that make a model "t observed data. For a multilayer perceptron (MLP) trained with back-propagation (BP...
200
click to vote
IEEEHPCS
2010
15 years 5 months ago
2010
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
324
click to vote
WASA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Due to the large-scale ad hoc deployments and wireless interference, data aggregation is a fundamental but time consuming task in wireless sensor networks. This paper foc...
154
click to vote
CRV
2009
IEEE
16 years 1 months ago
2009
IEEE
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...
157
click to vote
GECCO
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...