Pages that link to "Item:Q3989595"
From MaRDI portal
The following pages link to A new relaxation algorithm and passive sensor data association (Q3989595):
Displaying 15 items.
- The focus of attention problem (Q262243) (← links)
- Information value in nonparametric Dirichlet-process Gaussian-process (DPGP) mixture models (Q340712) (← links)
- Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) (Q882651) (← links)
- Localization of multiple emitters based on the sequential PHD filter (Q1048770) (← links)
- A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems (Q1366299) (← links)
- An LP-based algorithm for the data association problem in multitarget tracking. (Q1423449) (← links)
- A novel convex dual approach to three-dimensional assignment problem: theoretical analysis (Q2007830) (← links)
- A dual approach to multi-dimensional assignment problems (Q2052387) (← links)
- Data-driven combinatorial optimization for sensor-based assessment of near falls (Q2329894) (← links)
- A bi-criteria approach for the data association problem (Q2379873) (← links)
- New optimal algorithm of data association for multi-passive-sensor location system (Q2461479) (← links)
- Data association based on optimization in graphical models with application to sensor networks (Q2473188) (← links)
- The graph association problem: Mathematical models and a lagrangian heuristic (Q3120602) (← links)
- Branch and bound algorithms for the multidimensional assignment problem (Q5312759) (← links)
- A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements (Q5944024) (← links)
