Sciweavers

1661 search results - page 87 / 333
» Decision Tree Fields
Sort
View
APPML
2006
70views more  APPML 2006»
15 years 6 months ago
Legendre transform, Hessian conjecture and tree formula
Let be a polynomial over K (a field of characteristic 0) such that the Hessian of is a nonzero constant. Let
Guowu Meng
BILDMED
2006
169views Algorithms» more  BILDMED 2006»
15 years 7 months ago
Segmentation of the Vascular Tree in CT Data Using Implicit Active Contours
Abstract. We propose an algorithm for the segmentation of blood vessels in the kind of CT-data typical for diagnostics in a clinical environment. Due to poor quality and variance i...
Karsten Rink, Arne-Michael Törsel, Klaus D. T...
NIPS
2008
15 years 7 months ago
Multiscale Random Fields with Application to Contour Grouping
We introduce a new interpretation of multiscale random fields (MSRFs) that admits efficient optimization in the framework of regular (single level) random fields (RFs). It is base...
Longin Jan Latecki, ChengEn Lu, Marc Sobel, Xiang ...
ICIP
2009
IEEE
16 years 5 months ago
A Markov Random Field Model for Extracting Near-Circular Shapes
We propose a binary Markov Random Field (MRF) model that assigns high probability to regions in the image domain consisting of an unknown number of circles of a given radius. We...
Tamas Blaskovics, Zoltan Kato, and Ian Jermyn
ALT
2010
Springer
15 years 7 months ago
Lower Bounds on Learning Random Structures with Statistical Queries
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
Dana Angluin, David Eisenstat, Leonid Kontorovich,...