Sciweavers

879 search results - page 26 / 176
» Kolmogorov Complexity and Model Selection
Sort
View
CVPR
2006
IEEE
14 years 9 months ago
Escaping local minima through hierarchical model selection: Automatic object discovery, segmentation, and tracking in video
Recently, the generative modeling approach to video segmentation has been gaining popularity in the computer vision community. For example, the flexible sprites framework has been...
Nebojsa Jojic, John M. Winn, Larry Zitnick
BMCBI
2008
186views more  BMCBI 2008»
13 years 7 months ago
Variable selection for large p small n regression models with incomplete data: Mapping QTL with epistases
Background: Identifying quantitative trait loci (QTL) for both additive and epistatic effects raises the statistical issue of selecting variables from a large number of candidates...
Min Zhang, Dabao Zhang, Martin T. Wells
SCS
2004
13 years 9 months ago
Complex Reactive Real Time Systems and the Safety Case
Complex reactive real time systems are systems of systems that interact with the external world to perform selections of tasks in real time. They may be required to carry out sele...
Gordon R. Stone
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
ECCV
2006
Springer
14 years 9 months ago
Comparison of Energy Minimization Algorithms for Highly Connected Graphs
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
Vladimir Kolmogorov, Carsten Rother