Results 1 - 10 of 39,369

Table 1. Complexity Analysis

in Energy-Efficient Hybrid Key Management Protocol for Wireless Sensor Networks 1 Abstract
by Tim L, S. Jagannathan, Maciej Zawodniok
"... In PAGE 14: ...1. Complexity Analysis Table1 presents the results of the complexity analysis on the protocol and compares it to several existing key management schemes. The message cost incurred and complexity of the proposed algorithm are less than for the LEAP and the dynamic key management since it is typical to have the number of desired partial keys, m, be much greater than number of all nodes in the network, N, (n lt; lt;N.... In PAGE 15: ...subnetwork NS lt; N, m is number of desired partial keys, KL is individual key length, k is dynamic subnetwork key length, m is number of desired partial keys, L is length of key chain; and NCH is a number of cluster heads. For the Table1 , the degree of the network is defined as the average number of nodes that are within communication range of a given node. It is proportional to the density of nodes in the network and may be a value from 10 to 20 for a reasonably dense network.... ..."

Table 5. Complexity of analysis

in Modeling Out-of-Order Processors for Software Timing Analysis
by Xianfeng Li, Abhik Roychoudhury, Tulika Mitra 2004
"... In PAGE 17: ... Although there are some amount of increase with the path based analysis, it is still very efficient. Table5 gives some explanation for what accounted for the increase of complexity in a path based analy- sis. Columns #units are the numbers of analysis units (basic blocks in CFG or program paths in PFG).... ..."
Cited by 8

Table of Complexity Analysis Results

in List Processing Primitives for Parallel Computation
by Tom Axford, Mike Joy 1993
Cited by 8

Table of Complexity Analysis Results

in List Processing Primitives for Parallel Computation
by Tom Axford, Mike Joy 1993
Cited by 8

Table 1: Complexity Analysis.

in A Constraint Satisfaction Approach to Parametric Differential Equations
by M. Janssen, P. Van Hentenryck, Y. Deville

Table 1: Complexity Analysis.

in A Constraint Satisfaction Approach to Parametric Differential Equations
by M. Janssen, P. Van Hentenryck, Y. Deville

Table 2: Complexity Analysis.

in Rapid Inference on a Novel AND/OR graph forObject Detection, Segmentation and Parsing
by unknown authors

Table 2: Complexity Analysis.

in Rapid Inference on a Novel AND/OR graph for Object Detection, Segmentation and Parsing
by Yuanhao Chen, Chenxi Lin, Long (leo Zhu, Alan Yuille, Hongjiang Zhang

Table 1: time complexity analysis

in Abstract in
by Cheng-tao Chu, Yuanyuan Yu, Sang Kyun Kim, Gary Bradski, Kunle Olukotun, Yi-an Lin, Andrew Y. Ng 1993
"... In PAGE 5: ... 4.1 Algorithm Time Complexity Analysis Table1 shows the theoretical complexity analysis for the ten algorithms we implemented on top of our framework.... In PAGE 8: ...times speedup on a dual processor on up to 54 times speedup on 64 cores. These results are in line with the complexity analysis in Table1 . We note that the speedups achieved here involved no special optimizations of the algorithms themselves.... ..."
Cited by 1

Table 1: time complexity analysis

in Map-ReduceforMachineLearningonMulticore
by unknown authors
"... In PAGE 5: ... 4.1 Algorithm Time Complexity Analysis Table1 shows the theoretical complexity analysis for the ten algorithms we implemented on top of our framework.... In PAGE 8: ...times speedup on a dual processor on up to 54 times speedup on 64 cores. These results are in line with the complexity analysis in Table1 . We note that the speedups achieved here involved no special optimizations of the algorithms themselves.... ..."
Results 1 - 10 of 39,369