Sciweavers

15073 search results - page 339 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
ATAL
2010
Springer
15 years 6 months ago
Laplacian-based consensus on spatial computers
Robotic swarms, like all spatial computers, are a challenging environment for the execution of distributed consensus algorithms due to their scale, diameter, and frequent failures...
Nelson Elhage, Jacob Beal
POPL
2007
ACM
16 years 5 months ago
A proposal for parallel self-adjusting computation
We present an overview of our ongoing work on parallelizing self-adjusting-computation techniques. In self-adjusting computation, programs can respond to changes to their data (e....
Matthew Hammer, Umut A. Acar, Mohan Rajagopalan, A...
DIS
2007
Springer
15 years 11 months ago
Fast NML Computation for Naive Bayes Models
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...
Tommi Mononen, Petri Myllymäki
BMCBI
2004
133views more  BMCBI 2004»
15 years 4 months ago
Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction
Background: RNA secondary structure prediction methods based on probabilistic modeling can be developed using stochastic context-free grammars (SCFGs). Such methods can readily co...
Robin D. Dowell, Sean R. Eddy
KDD
2007
ACM
237views Data Mining» more  KDD 2007»
16 years 5 months ago
Knowledge discovery of multiple-topic document using parametric mixture model with dirichlet prior
Documents, such as those seen on Wikipedia and Folksonomy, have tended to be assigned with multiple topics as a meta-data. Therefore, it is more and more important to analyze a re...
Issei Sato, Hiroshi Nakagawa