2223 search results - page 53 / 445 » Ontological Framework for Approximation |
137
click to vote
SIAMJO
2011
14 years 11 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
148
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
143
click to vote
CVPR
2011
IEEE
15 years 22 days ago
2011
IEEE
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...
140
click to vote
ICCV
2005
IEEE
16 years 6 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
138
click to vote
KDD
2000
ACM
15 years 8 months ago
2000
ACM
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...