3875 search results - page 423 / 775 » Approximation algorithms for the 0-extension problem |
180
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
224
click to vote
JMLR
2010
15 years 1 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
184
click to vote
CVPR
1999
IEEE
16 years 8 months ago
1999
IEEE
This paper addresses the problem of estimating the epipolar geometry from apparent contours in two special cases: under weak perspective and for circular motion. An appropriate pa...
174
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
Recent successful techniques for the efficient simulation of largescale interconnect models rely on the sparsification of the inverse of the inductance matrix L. While there are...
196
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...