142 search results - page 13 / 29 » Approximate maximum weight branchings |
99
Voted
ACL
2010
14 years 11 months ago
2010
We consider the search for a maximum likelihood assignment of hidden derivations and grammar weights for a probabilistic context-free grammar, the problem approximately solved by ...
124
click to vote
CG
2002
Springer
15 years 1 months ago
2002
Springer
Convolution surface has the advantage of being crease-free and bulge-free over other kinds of implicit surfaces. Among the various types of skeletal elements, line segments can be...
148
click to vote
SPAA
1999
ACM
15 years 6 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
127
click to vote
CDC
2009
IEEE
14 years 11 months ago
2009
IEEE
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...
115
click to vote
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...