Sciweavers

1957 search results - page 150 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
ICSE
2009
IEEE-ACM
15 years 10 months ago
Effective static deadlock detection
We present an effective static deadlock detection algorithm for Java. Our algorithm uses a novel combination of static analyses each of which approximates a different necessary co...
Mayur Naik, Chang-Seo Park, Koushik Sen, David Gay
CGF
2010
234views more  CGF 2010»
14 years 7 months ago
3D Surface Reconstruction Using a Generalized Distance Function
We define a generalized distance function on an unoriented 3D point set and describe how it may be used to reconstruct a surface approximating these points. This distance function...
R. Poranne, Craig Gotsman, Daniel Keren
SADM
2008
178views more  SADM 2008»
14 years 9 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
ICASSP
2009
IEEE
15 years 4 months ago
Document reconstruction using dynamic programming
In this work we propose a methodology for document reconstruction based on dynamic programming and a modified version of the Prim’s algorithm. Firstly, we use polygonal approxi...
Andre Pimenta, Edson J. R. Justino, Luiz S. Olivei...
UAI
2001
14 years 11 months ago
Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
John D. Lafferty, Larry A. Wasserman