Implementation of the Murty algorithm to obtain the best K assignments. Includes the implementation of the Jonker-Volgenant algorithm. Usual applications are multiple target tracking algorithms, Joint Probabilistic Data Association (JPDA), Multiple Hypothesis Tracking (MHT), Global Nearest Neighbours (GNN), etc. Based on the original code by Jonker-Volgenant, and the Murty Matlab implementation by Eric Trautmann Can be used both from Java or Matlab. Time for a 100x100 assignment problem, with k=20: • Matlab implementation: 54.5 sec • Java implementation: 1 sec

java-k-best-1.00\src\com\google\code\javakbest\Murty.java
................\...\...\......\....\.........\JVC.java
................\...\...\......\....\.........\PartitionNode.java
................\...\...\......\....\.........\Test.java
................\...\...\......\....\.........\Node.java
................\README.TXT
................\java-k-best.jar
................\findkbest.m
................\LICENSE
................\src\com\google\code\javakbest
................\...\...\......\code
................\...\...\google
................\...\com
................\src
java-k-best-1.00

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．