7129 search results - page 255 / 1426 » Approximation Algorithms for Treewidth |
130
click to vote
NIPS
1998
15 years 5 months ago
1998
We present Monte-Carlo generalized EM equations for learning in nonlinear state space models. The dif
122
Voted
CAD
2002
Springer
15 years 4 months ago
2002
Springer
A general discussion of the including approximation of a curve by a fat arc is given followed by an algorithm for constructing an including fat arc for a parametric Be
149
Voted
GLOBECOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks. The costoptimal multicast light-tree is NP-hard to compute, especially w...
142
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...
137
click to vote
PODS
2004
ACM
16 years 4 months ago
2004
ACM
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...