Academic
Publications
Introduction to Algorithms

Introduction to Algorithms,T. H. Cormen,C. E. Leiserson,R. L. Rivest

Introduction to Algorithms   (Citations: 113)
BibTex | RIS | RefWorks Download
Published in 2003.
Cumulative Annual
    • ...Floyd‐Warshall algorithm [30] computes all-pair-shortest path to evaluate the eccentricity e(u) of each pose u ∈ S using Definition 2. For each action, we choose the unambiguous poses by selecting poses with significantly low eccentricity value (i.e., key poses) in a pose graph...

    Snehasis Mukherjeeet al. Recognizing Human Action at a Distance in Video by Key Poses

    • ...Determining a minimal cover set is an NP complete problem [3]...
    • ...The greedy set cover algorithm from [3] was modified to c over all high and medium confidence locations, ensuring that any location covered with high confidence maintains high confidence coverage in the minimal set...
    • ...The approximation performance analysis of the algorithm is modified from the analysis in Cormen [3]...
    • ...The proof of this inequality is given in [3]...

    Daniel Flecket al. Predicting image matching using affine distortion models

    • ...First, we show that the k-firewall decision problem 2 NP. Second, we show that it is NP-hard by reducing the set-partition problem (known to be NP-complete [9]) to the k-firewall decision problem in polynomial time...
    • ...In that case, because the set-partition problem is NP-hard [9], the k-firewall decision problem is also NP-hard...

    MyungKeun Yoonet al. Minimizing the Maximum Firewall Rule Set in a Network with Multiple Fi...

    • ...4: line 7). A good sorting algorithm, e.g., mergesort or heapsort, has a runtime complexity of O (nc log nc) [19]...

    Faraz Ahmed Memonet al. Index recommendation tool for optimized information discovery over dis...

    • ...Floyd-Warshall algorithm [4] computes all-pair-shortest path to evaluate the eccentricity e(u) of each poseu 2 S using Deflnition 2. According to Deflnition 2, eccentricity e(u) is a measure of ambiguity of the pose u. So for each action, we choose the unambiguous poses by selecting poses with signiflcantly low eccentricity value in a pose graph...

    Snehasis Mukherjeeet al. Human action recognition in video by 'meaningful' poses

Sort by: