3096 search results - page 254 / 620 » Theory and Use of the EM Algorithm |
161
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
154
click to vote
CAV
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
175
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
142
click to vote
CVPR
1997
IEEE
16 years 8 months ago
1997
IEEE
Until now, all super-resolution algorithms have presumed that the images were taken under the same illumination conditions. This paper introduces a new approach to super-resolutio...
191
click to vote
CADE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...