Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
4,744
Table 1: Recent Advances in the DWDM Records
"... In PAGE 2: ... For example, technology that takes 10Gb/s to 1,000km may not be able to carry 20Gb/s to 500kms. Table1 shows some of the recent records. Each of these records improves one of the three factors over other records.... ..."
Table 11.8. FACS AU or expression recognition of recent advances. SVM, support vector ma- chines; MLR, multinomial logistic ridge regression; HMM, hidden Markov models; BN, Bayesian network; GMM, Gaussian mixture model. Systems Recognition Recognition Recognized Databases
Table 1. Recent (within the past 5 years) Travel Behavior Applications of Advanced Discrete Choice Models
"... In PAGE 29: ...0 Applications Of Advanced Discrete Choice Models And Conclusions There have been several applications of advanced discrete choice models in the past few years. Table1 presents various studies within the past five years, organized by model type. The model types are: Generalized Extreme Value (GEV) models, Mixed Multinomial Logit (MMNL) mod- els, and mixed GEV models and other mixed models.... In PAGE 29: ... The model types are: Generalized Extreme Value (GEV) models, Mixed Multinomial Logit (MMNL) mod- els, and mixed GEV models and other mixed models. Several important observations may be made based on Table1... In PAGE 30: ... Such a MGEV structure, in fact, may be the only practical solution in some situations (for exam- ple, see Bhat and Guo, 2003). Fifth, Table1 indicates that, while the number of applications of advanced discrete choice models in the area of travel behavior modeling has risen considerably in the past few years, only a small group of researchers have been involved with such methods. Hopefully, the important progress in both conceptual and computational issues in the recent past... ..."
Table 1 possess the following capabilities: #0F They offer applications the ability to flexibly config- ure layered resource management mechanisms needed to control their QoS end-to-end; #0F They automatically protect resources needed by certain application-critical operations; #0F They promote autonomous or semi-autonomous behavior to respond adaptively and reflectively to changing situa- tional aspects in their run-time environment. The following section summarizes recent advances in DOC middleware that provide COTS-based implementations for some of these capabilities.
2000
"... In PAGE 4: ...1. Table1 characterizes the key challenges as- sociated with developing QoS-enabled middleware for next- generation distributed applications. In general, solutions that are emerging to meet the QoS-related challenges outlined in Table 1 possess the following capabilities: #0F They offer applications the ability to flexibly config- ure layered resource management mechanisms needed to control their QoS end-to-end; #0F They automatically protect resources needed by certain application-critical operations; #0F They promote autonomous or semi-autonomous behavior to respond adaptively and reflectively to changing situa- tional aspects in their run-time environment.... ..."
Cited by 2
Table 3: Comparison of 3D SPIHT, MC 3D SPIHT, and H.263 relative computational complexity for encoding 0 - 285 \Carphone quot; sequence at 10 f/s, and 30 kbps. Complexity is computed on SUN SPARC 20 machine. A more detailed breakdown of computation times was undertaken for the various stages in the encoding and decoding of QCIF 4:2:0 YUV color sequences. Table 4 shows run times of these stages on a SUN SPARC 20 for 96 frames of the quot;Carphone quot; sequence, speci cally every third frame of frames 0{285 (10 f/s), encoded at 30 Kbps. Note that 57 % of the encoding time and 78 % of the decoding time are spent on wavelet transformation and its inverse, respectively. Considering that the 3D SPIHT coder is not fully optimized and there have been recent advances in fast lter design, 3D SPIHT shows promise of becoming a real-time software-only video codec, as seen from the actual coding and decoding times in Table 4. Functions time in sec relative time (%)
"... In PAGE 20: ...3 Computation Times Now, we assess the computational complexity in terms of the run times of the stages of transfor- mation, encoding, decoding, and search for maximum magnitudes. First, relative times per frame are shown in Table3 for 3D SPIHT, motion-compensated (MC) 3D SPIHT and H.263 for encoding the Carphone sequence at 10 f/s, every third frame from frame 0 to 285, at 30 kbps.... ..."
Table 3: Comparison of 3D SPIHT, MC 3D SPIHT, and H.263 relative computational complexity for encoding 0 - 285 \Carphone quot; sequence at 10 f/s, and 30 kbps. Complexity is computed on SUN SPARC 20 machine. A more detailed breakdown of computation times was undertaken for the various stages in the encoding and decoding of QCIF 4:2:0 or 4:1:1 YUV color sequences. Table 4 shows run times of these stages on a SUN SPARC 20 for 96 frames of the apos;Carphone apos; sequence, speci cally every third frame of frames 0{285 (10 f/s), encoded at 30 Kbps. Note that 57 % of the encoding time and 78 % of the decoding time are spent on wavelet transformation and its inverse, respectively. Considering that the 3D SPIHT coder is not fully optimized and there have been recent advances in fast lter design, 3D SPIHT shows promise of becoming a real-time software-only video codec, as seen from the actual coding and decoding times in Table 4. 19
in Very Low Bit-Rate Embedded Video Coding with 3D Set Partitioning in Hierarchical Trees (3D SPIHT)
"... In PAGE 19: ...3 Computation Times Now, we assess the computational complexity in terms of the run times of the stages of transfor- mation, encoding, decoding, and search for maximum magnitudes. First, relative times per frame are shown in Table3 for 3D SPIHT, motion-compensated (MC) 3D SPIHT and H.263 for encoding the Carphone sequence at 10 f/s (every third frame) from frame 0 to 285 at 30 kbps.... ..."
Table 1. Recent NMOS device results, compared with ITRS projections.
2001
"... In PAGE 3: ... To give further perspective on Ioff scaling, we examined recent litera- ture on advanced CMOS processes, noting the Ion, Ioff, Vdd, and Tox (oxide thickness) values. Results are summarized in Table1 . The key point of this table is that, while very good Ion/Ioff characteristics are achieved, there are no examples of sub-1 V technologies that come close to meeting ITRS expectations.... ..."
Cited by 6
Table 1. Recent NMOS device results, compared with ITRS projections.
2001
"... In PAGE 3: ... To give further perspective on Ioff scaling, we examined recent litera- ture on advanced CMOS processes, noting the Ion, Ioff, Vdd, and Tox (oxide thickness) values. Results are summarized in Table1 . The key point of this table is that, while very good Ion/Ioff characteristics are achieved, there are no examples of sub-1 V technologies that come close to meeting ITRS expectations.... ..."
Cited by 6
Table 2. A summary of major advanced classification methods.
"... In PAGE 7: ...ield. Table 1 provides brief descriptions of these categories. For the sake of convenience, this paper groups classification approaches as per-pixel, subpixel, per- field, contextual-based, knowledge-based, and a combination of multiple classifiers. Table2 lists major advanced classification approaches that have appeared in recent literature. A brief description of each category is provided in the following subsection.... ..."
Results 1 - 10
of
4,744
