2520 search results - page 344 / 504 » The complexity of approximating entropy |
137
click to vote
STACS
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
159
click to vote
AGP
1996
IEEE
15 years 8 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
148
click to vote
ICCAD
1993
IEEE
15 years 8 months ago
1993
IEEE
For submicron integrated circuits, 3D numerical techniques are required to accurately compute the values of the interconnect capacitances. In this paper, we describe an hierarchic...
137
click to vote
SIGGRAPH
1994
ACM
15 years 8 months ago
1994
ACM
In this paper we discuss the efficient and accurate incorporation of texture maps into a hierarchical Galerkin radiosity algorithm. This extension of the standard algorithm allows...
147
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...