51 search results - page 9 / 11 » Search for Dynamic Equilibrium in Duel Problems by Global Op... |
ICRA
2002
IEEE
13 years 10 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
We propose a linear programming relaxation scheme for the class of multiple object tracking problems where the inter-object interaction metric is convex and the intraobject term q...
ECML
2007
Springer
13 years 7 months ago
2007
Springer
Many problems in areas such as Natural Language Processing, Information Retrieval, or Bioinformatic involve the generic task of sequence labeling. In many cases, the aim is to assi...
ICCV
2003
IEEE
14 years 7 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
JMLR
2010
13 years 17 days ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...