Sciweavers

580 search results - page 48 / 116
» On the memory complexity of the forward-backward algorithm
Sort
View
UAI
1997
13 years 10 months ago
Exploring Parallelism in Learning Belief Networks
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
Tongsheng Chu, Yang Xiang
SIGGRAPH
2000
ACM
14 years 16 days ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
UAI
2008
13 years 10 months ago
Strategy Selection in Influence Diagrams using Imprecise Probabilities
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
Cassio Polpo de Campos, Qiang Ji
TPDS
2002
94views more  TPDS 2002»
13 years 8 months ago
Recursive Array Layouts and Fast Matrix Multiplication
The performance of both serial and parallel implementations of matrix multiplication is highly sensitive to memory system behavior. False sharing and cache conflicts cause traditi...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....
ML
2010
ACM
142views Machine Learning» more  ML 2010»
13 years 7 months ago
Fast adaptive algorithms for abrupt change detection
We propose two fast algorithms for abrupt change detection in streaming data that can operate on arbitrary unknown data distributions before and after the change. The first algor...
Daniel Nikovski, Ankur Jain