<--- Back to Details
First PageDocument Content
Combinatorial optimization / Hungarian algorithm / Matching / Time complexity / Dynamic programming
Date: 2010-01-19 22:43:36
Combinatorial optimization
Hungarian algorithm
Matching
Time complexity
Dynamic programming

Add to Reading List

Source URL: ceng.usc.edu

Download Document from Source Website

File Size: 235,92 KB

Share Document on Facebook

Similar Documents

SoK: Deep Packer Inspection: A Longitudinal Study of the Complexity of Run-Time Packers Xabier Ugarte-Pedrero∗ , Davide Balzarotti† , Igor Santos∗ , Pablo G. Bringas∗ ∗  DeustoTech, University of Deusto

SoK: Deep Packer Inspection: A Longitudinal Study of the Complexity of Run-Time Packers Xabier Ugarte-Pedrero∗ , Davide Balzarotti† , Igor Santos∗ , Pablo G. Bringas∗ ∗ DeustoTech, University of Deusto

DocID: 1v9SC - View Document

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits

DocID: 1v8bH - View Document

J Real-Time Image Proc:5–24 DOIs11554SPECIAL ISSUE PAPER  Complexity control of HEVC encoders targeting real-time

J Real-Time Image Proc:5–24 DOIs11554SPECIAL ISSUE PAPER Complexity control of HEVC encoders targeting real-time

DocID: 1uq0O - View Document

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits

DocID: 1umuY - View Document

A Gentle Introduction to the Time Complexity Analysis of Evolutionary Algorithms Pietro S. Oliveto Department of Computer Science The University of Sheffield, Sheffield, UK email:

A Gentle Introduction to the Time Complexity Analysis of Evolutionary Algorithms Pietro S. Oliveto Department of Computer Science The University of Sheffield, Sheffield, UK email:

DocID: 1uaFl - View Document