1847 search results - page 126 / 370 » Hybrid Functional Interpretations |
203
click to vote
NIPS
2003
15 years 7 months ago
2003
In this paper we introduce a new underlying probabilistic model for principal component analysis (PCA). Our formulation interprets PCA as a particular Gaussian process prior on a ...
151
click to vote
IJON
2008
15 years 5 months ago
2008
Identifiability becomes an essential requirement for learning machines when the models contain physically interpretable parameters. This paper presents two approaches to examining...
149
click to vote
IANDC
2007
15 years 5 months ago
2007
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependen...
152
click to vote
JSYML
2002
15 years 5 months ago
2002
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
139
click to vote
UIST
2000
ACM
15 years 10 months ago
2000
ACM
Software support for making effective pen-based applications is currently rudimentary. To facilitate the creation of such applications, we have developed SATIN, a Java-based toolk...