2612 search results - page 324 / 523 » Switching Graphs and Their Complexity |
135
click to vote
CGF
1999
15 years 4 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
135
click to vote
MICS
2010
15 years 3 months ago
2010
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
174
click to vote
CVPR
2011
IEEE
15 years 23 days ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
136
click to vote
DAM
2011
14 years 11 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
129
click to vote
SIAMJO
2010
14 years 11 months ago
2010
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...