10054 search results - page 172 / 2011 » On the Complexity of Function Learning |
112
click to vote
ICML
1999
IEEE
16 years 1 months ago
1999
IEEE
Many interesting problems, such as power grids, network switches, and tra c ow, that are candidates for solving with reinforcement learningRL, alsohave properties that make distri...
DAM
2007
15 years 20 days ago
2007
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
116
click to vote
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
130
Voted
IFL
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. In this paper we compare three systems for tracing and debugging Haskell programs: Freja, Hat and Hood. We evaluate their usefulness in practice by applying them to a num...
90
Voted
CRYPTO
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than ...