Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Subscribe
Academic
Publications
Introduction to Algorithms
Introduction to Algorithms,T. H. Cormen,C. E. Leiserson,R. L. Rivest
Edit
Introduction to Algorithms
(
Citations: 113
)
BibTex

RIS

RefWorks
Download
T. H. Cormen
,
C. E. Leiserson
,
R. L. Rivest
Published in 2003.
Cumulative
Annual
Citation Context
(38)
...Floyd‐Warshall algorithm [
30
] computes allpairshortest 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 Mukherjee
,
et 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 Fleck
,
et al.
Predicting image matching using affine distortion models
...First, we show that the kfirewall decision problem 2 NP. Second, we show that it is NPhard by reducing the setpartition problem (known to be NPcomplete [
9
]) to the kfirewall decision problem in polynomial time...
...In that case, because the setpartition problem is NPhard [
9
], the kfirewall decision problem is also NPhard...
MyungKeun Yoon
,
et 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 Memon
,
et al.
Index recommendation tool for optimized information discovery over dis...
...FloydWarshall algorithm [
4
] computes allpairshortest 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 Mukherjee
,
et al.
Human action recognition in video by 'meaningful' poses
Sort by:
Citations
(113)
Advanced hashing schemes for packet forwarding using set associative memory architectures
(
Citations: 1
)
Michel Hanna
,
Socrates Demetriades
,
Sangyeun Cho
,
Rami G. Melhem
Journal:
Journal of Parallel and Distributed Computing  JPDC
, vol. 71, no. 1, pp. 115, 2011
Recognizing Human Action at a Distance in Video by Key Poses
Snehasis Mukherjee
,
Sujoy Kumar Biswas
,
Dipti Prasad Mukherjee
Journal:
IEEE Transactions on Circuits and Systems for Video Technology  TCSV
, vol. 21, no. 9, pp. 12281241, 2011
Predicting image matching using affine distortion models
Daniel Fleck
,
Zoran Duric
Conference:
Computer Vision and Pattern Recognition  CVPR
, pp. 105112, 2011
Data dependency reduction in Dynamic Programming matrix
Guillermo Delgado
,
Chatchawit Aporntewan
Conference:
International Joint Conference on Computer Science and Software Engineering  JCSSE
, 2011
Minimizing the Maximum Firewall Rule Set in a Network with Multiple Firewalls
(
Citations: 5
)
MyungKeun Yoon
,
Shigang Chen
,
Zhan Zhang
Journal:
IEEE Transactions on Computers  TC
, vol. 59, no. 2, pp. 218230, 2010