Sciweavers

2125 search results - page 244 / 425
» On Graph Complexity
Sort
View
124
Voted
CGF
1999
125views more  CGF 1999»
15 years 3 months ago
Partitioning and Handling Massive Models for Interactive Collision Detection
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...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...
156
Voted
CVPR
2011
IEEE
14 years 11 months ago
Learning Message-Passing Inference Machines for Structured Prediction
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
Stephane Ross, Daniel Munoz, J. Andrew Bagnell
DAM
2011
14 years 10 months ago
Matchability and k-maximal matchings
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...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
215
Voted
CDC
2010
IEEE
172views Control Systems» more  CDC 2010»
14 years 7 months ago
Electrical centrality measures for electric power grid vulnerability analysis
— This paper investigates measures of centrality that are applicable to power grids. Centrality measures are used in network science to rank the relative importance of nodes and ...
Zhifang Wang, Anna Scaglione, Robert J. Thomas
STACS
2009
Springer
15 years 10 months ago
Tractable Structures for Constraint Satisfaction with Truth Tables
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
Dániel Marx