801 search results - page 108 / 161 » Minimal Locked Trees |
AAAI
2011
13 years 9 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
116
click to vote
CVPR
2012
IEEE
13 years 5 days ago
2012
IEEE
In this paper we address multi-view reconstruction of urban environments using 3D shape grammars. Our formulation expresses the solution to the problem as a shape grammar parse tr...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
180
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Workflows are widely used for representing business processes, web services, scientific experiments, and activities in daily life, like recipes. There is an increasing need for peo...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...