299 search results - page 43 / 60 » A Convex Relaxation Approach for Computing Minimal Partition... |
AUTOMATICA
2008
14 years 10 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
108
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
CONCUR
1991
Springer
15 years 1 months ago
1991
Springer
This paper deals with verification methods based on equivalence relations between labeled transition systems. More precisely, we are concerned by two practical needs: how to effi...
CG
2005
Springer
14 years 9 months ago
2005
Springer
Space-Partition Octree (SP-Octree) is a hierarchical representation scheme for solid modelling. It allows a multiresolution representation of polyhedral objects, and has been succ...
GD
1998
Springer
15 years 2 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...