Thread Tree View: comp.doc.techreports
1 messages
Depth: 0
Cached
Build time: 845.94µsms
| 1 messages | Max depth: 0
Thread Tree
1 nodes
max depth: 0
1 leaves
-
UCSC TR: Bounds on Approximate Steepest Descent for Likelihood Maximization in Exponential Families 1993-01-06 12:53 👁
Root Message
UCSC TR: Bounds on Approximate Steepest Descent for Likelihood Maximization in Exponential Families
From: Jean McKnight
Date: Wed, 06 Jan 1993 12:53
Article: 146
Message-ID: <1iekogINNbj9@darkstar.UCSC.EDU>
Debug Information
Tree Statistics
- Root Article: 146
- Message Count: 1
- Max Depth: 0
- Cache Hit: Yes
- Build Time: 845.94µs
Thread Root
- Subject: UCSC TR: Bounds on Approximate Steepest Descent for Likelihood Maximization in Exponential Families
- From: Jean McKnight
- Date: Wed, 06 Jan 1993 12:53
- Article: 146