3874 search results - page 390 / 775 » Approximation Algorithms for k-hurdle Problems |
167
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...
169
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...
159
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...
178
click to vote
INFOCOM
2009
IEEE
16 years 28 days 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 ...
180
click to vote
TSP
2008
15 years 4 months ago
2008
The basic nonlinear filtering problem for dynamical systems is considered. Approximating the optimal filter estimate by particle filter methods has become perhaps the most common a...