17760 search results - page 29 / 3552 » A Generalization of the Massey-Ding Algorithm |
ISIPTA
2005
IEEE
14 years 2 months ago
2005
IEEE
This paper discusses decision making in the practically important situation where only partial prior information on the stochastic behavior of the states of nature expressed by im...
ACL
1994
13 years 10 months ago
1994
We present an efficient procedure for cost-based abduction, which is based on the idea of using chart parsers as proof procedures. We discuss in detail three features of our algor...
NIPS
2001
13 years 10 months ago
2001
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that RT R is close to AT A. Thus, when the algorithm is used ...
ICPP
1995
IEEE
14 years 17 days ago
1995
IEEE
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...