123 search results - page 17 / 25 » Complexity of Boolean Functions on PRAMs - Lower Bound Techn... |
IJCNN
2007
IEEE
14 years 1 months ago
2007
IEEE
— To obtain accurate modeling results, it is of primal importance to find optimal values for the hyperparameters in the Support Vector Regression (SVR) model. In general, we sea...
IPL
2010
13 years 5 months ago
2010
We study the problem of learning parity functions that depend on at most k variables (kparities) attribute-efficiently in the mistake-bound model. We design a simple, deterministi...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
ENTCS
2007
13 years 7 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
ISPD
1998
ACM
13 years 11 months ago
1998
ACM
Wirelength estimation in VLSI layout is fundamental to any pre-detailed routing estimate of timing or routability. In this paper, we develop e cient wirelength estimation techniqu...