6365 search results - page 849 / 1273 » Fast Local Computation Algorithms |
223
Voted
CORR
2012
Springer
14 years 3 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
201
Voted
NIPS
2001
15 years 9 months ago
2001
Bayesian belief propagation in graphical models has been recently shown to have very close ties to inference methods based in statistical physics. After Yedidia et al. demonstrate...
198
Voted
DSP
2007
15 years 7 months ago
2007
We tackle the general linear instantaneous model (possibly underdetermined and noisy) where we model the source prior with a Student t distribution. The conjugate-exponential char...
220
Voted
DAM
2000
15 years 7 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
215
Voted
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
We propose a global optimization framework for 3D shape reconstruction from sparse noisy 3D measurements frequently encountered in range scanning, sparse featurebased stereo, and ...