1684 search results - page 74 / 337 » The lexicographic decision function |
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...
107
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
165
click to vote
ISMVL
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper considers representations for elementary functions such as polynomial, trigonometric, logarithmic, square root, and reciprocal functions. These real valued functions ar...
121
Voted
ESANN
2001
15 years 4 months ago
2001
Abstract. Sigmoidal or radial transfer functions do not guarantee the best generalization nor fast learning of neural networks. Families of parameterized transfer functions provide...
143
Voted
KDD
2007
ACM
16 years 3 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...