199 search results - page 16 / 40 » Fast Algorithms for Computing Tree LCS |
100
click to vote
ICCV
2001
IEEE
16 years 1 months ago
2001
IEEE
Tree-structured probabilistic models admit simple, fast inference. However, they are not well suited to phenomena such as occlusion, where multiple components of an object may dis...
110
click to vote
COCOA
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
109
click to vote
CGF
2008
14 years 11 months ago
2008
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
130
click to vote
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
COCOON
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we deal with restoring missing information in molecule databases: Some data formats only store the atoms’ configuration but omit bond multiplicities. As this info...