108 search results - page 1 / 22 » Zeta: A Global Method for Discretization of Continuous Varia... |
52
Voted
KDD
1997
ACM
15 years 1 months ago
1997
ACM
113
click to vote
COCOS
2003
Springer
15 years 2 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
105
click to vote
ICCV
2001
IEEE
15 years 11 months ago
2001
IEEE
Robust, real-time tracking of objects from visual data requires probabilistic fusion of multiple visual cues. Previous approaches have either been ad hoc or relied on a Bayesian n...
114
click to vote
UAI
1998
14 years 11 months ago
1998
In this paper we address the problem of discretization in the context of learning Bayesian networks (BNs) from data containing both continuous and discrete variables. We describe ...
UAI
2004
14 years 11 months ago
2004
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...