3049 search results - page 397 / 610 » On the Convergence of Bound Optimization Algorithms |
134
Voted
DAC
1994
ACM
15 years 8 months ago
1994
ACM
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
135
click to vote
INFOCOM
1992
IEEE
15 years 8 months ago
1992
IEEE
This paper describes a methodology for designing interconnected LAN-MAN networks with the objective of minimizing the average network delay. We consider IEEE 802.3-5 LANs intercon...
143
click to vote
ORDER
2007
15 years 4 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
172
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Many vision problems can be cast as optimizing the conditional probability density function p(C|I) where I is an image and C is a vector of model parameters describing the image. ...
141
Voted
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
Given a dense set of imperfect normals obtained by photometric stereo or shape from shading, this paper presents an optimization algorithm which alternately optimizes until conver...