Sciweavers

759 search results - page 11 / 152
» Structured Learning with Approximate Inference
Sort
View
AAAI
2008
13 years 9 months ago
Learning to Analyze Binary Computer Code
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...
UAI
1998
13 years 8 months ago
Context-specific approximation in probabilistic inference
There is evidence that the numbers in probabilistic inference don't really matter. This paper considers the idea that we can make a probabilistic model simpler by making fewe...
David Poole
ICML
2009
IEEE
14 years 8 months ago
A Bayesian approach to protein model quality assessment
Given multiple possible models b1, b2, . . . bn for a protein structure, a common sub-task in in-silico Protein Structure Prediction is ranking these models according to their qua...
Hetunandan Kamisetty, Christopher James Langmead
ML
2008
ACM
13 years 7 months ago
A bias/variance decomposition for models using collective inference
Bias/variance analysis is a useful tool for investigating the performance of machine learning algorithms. Conventional analysis decomposes loss into errors due to aspects of the le...
Jennifer Neville, David Jensen
ICRA
2009
IEEE
188views Robotics» more  ICRA 2009»
13 years 5 months ago
Onboard contextual classification of 3-D point clouds with learned high-order Markov Random Fields
Contextual reasoning through graphical models such as Markov Random Fields often show superior performance against local classifiers in many domains. Unfortunately, this performanc...
Daniel Munoz, Nicolas Vandapel, Martial Hebert