16430 search results - page 431 / 3286 » On Computable Tree Functions |
189
click to vote
EUROPAR
2004
Springer
16 years 7 days ago
2004
Springer
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
184
click to vote
SCAM
2003
IEEE
16 years 3 days ago
2003
IEEE
We characterise a computational model for processing annotated parse trees. The model is basically rewriting-based with specific provisions for dealing with annotations along the...
159
click to vote
AAAI
2008
15 years 9 months ago
2008
We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and wh...
230
click to vote
NIPS
2008
15 years 8 months ago
2008
The Singular Value Decomposition is a key operation in many machine learning methods. Its computational cost, however, makes it unscalable and impractical for applications involvi...
201
click to vote
UAI
2008
15 years 8 months ago
2008
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...