• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 10,695
Next 10 →

Table 3 Composite and superstrate configurations: accuracy of the closed-form expressions used.

in An Investigation of the Material and Process Parameters for Thin-film MCM-D and MCM-L Technologies up to 100GHz
by Janusz Grzyb, Ivan Ruiz, Didier Cottet, Gerhard Tröster
"... In PAGE 7: ...ubstrate. Detailed formulas can be found in [15]. Different multi-layer composite and superstrate build- ups within our technology set have been tested. Their parameters are collected in the following Table3 . The accuracy results for the these configurations are shown in the similar form as for single dielectric configuration and are presented in Table 4 and Fig.... ..."

Table 2a: Closed Form Expressions For Bayes Factor Under Conjugate Prior: w(y) = e y Likelihood Prior Bayes Factor

in Weighted Distributions Viewed in the Context of Model Selection: A Bayesian Perspective
by Daniel Larose, Dipak K. Dey 1994
"... In PAGE 19: ...Table2 b: Closed Form Expressions For Bayes Factor Under Conjugate Prior: w(y) = y or y( ) = y(y ? 1):::(y ? + 1) Likelihood Prior Bayes Factor Gamma( ; ) Gamma( ; ) ?( + )?( + )(y+ ) ?( )?( + + ) Exp0l ( ) Gamma( ; ) ?( +1)?( +1)(y+ ) ?( + +1) Normal( ; 1) Normal( ; 2) Use Tierney-Kadane Approximation Poisson( ) Gamma( ; ) ?(y+ ) ?(y+ ? )y( )(1+ ) Neg.Bin.... ..."
Cited by 5

TABLE I CLOSED-FORM EXPRESSIONS FOR pM(k|i), E[bi,j] AND E[b2 i,j]

in Throughput guarantees for wireless networks with opportunistic scheduling.” , http://folk.ntnu.no/vegardh/RateGuar-ver12.pdf. Accepted for presentation at
by Vegard Hassel, Geir E. Øien, David Gesbert 2006

Table 7.1: Loss probabilities for uniform deadlines, derived from numeric convolution (C), numeric inversion of the Laplace transform (L), closed-form expression (F) or closed-form inversion of the Laplace transform (I)

in Congestion Control for Real-Time Traffic in High-Speed Networks
by Henning Schulzrinne, James F. Kurose, Don Towsley 1990
Cited by 10

Table 1: Closed Form Analytical Expressions for the gradi- ent and Hessian of the cost function and constraints Cost function - JW

in TIME DOMAIN OPTIMIZATION TECHNIQUES FOR BLIND SEPARATION OF NON-STATIONARY CONVOLUTIVE MIXED SIGNALS
by Iain Russell, Alfred Mertins, Jiangtao Xi

Table 2b: Closed Form Expressions For Bayes Factor Under Conjugate Prior: w(y) = y or y( ) = y(y ? 1):::(y ? + 1) Likelihood Prior Bayes Factor

in Weighted Distributions Viewed in the Context of Model Selection: A Bayesian Perspective
by Daniel Larose, Dipak K. Dey 1994
"... In PAGE 18: ...Table2 a: Closed Form Expressions For Bayes Factor Under Conjugate Prior: w(y) = e y Likelihood Prior Bayes Factor Gamma( ; ) Gamma( ; ) Use Tierney-Kadane Approximation Exp0l ( ) Gamma( ; ) e? y ? (y+ ) Normal( ; 1) Normal( ; 2) exp[12 2(1 ? ?1) + ( (y) ? y)] where (y) = ( 1 1+ 2 ) 0 + 2 1+ 2 y ?1 = 2=( 2 + 1) Poisson( ) Gamma( ; ) (e + 1+ ) ( e + (1+ )e )y Neg.Bin.... ..."
Cited by 5

Table 2: Times (in microseconds) for closed form expressions (CF), Loop enumeration (LSU), Rice code, and the Sort approach on an IBM SP-2 (p = 32; s = 7; s = 99)

in Efficient Computation of Address Sequences in Data Parallel Programs Using Closed Forms for Basis Vectors
by Ashwath Thirumalai, J. Ramanujam

Table 4: Times (in microseconds) for closed form expressions (CF), Loop enumeration (LSU), Rice code, and the Sort approach on an IBM SP-2 (p = 32; s = pk ? 1; s = pk + 1)

in Efficient Computation of Address Sequences in Data Parallel Programs Using Closed Forms for Basis Vectors
by Ashwath Thirumalai, J. Ramanujam

Table 2: Times (in microseconds) for closed form expressions (CF), Loop enumeration (LSU), Rice code, and the Sort approach on an IBM SP-2 (p = 32; s = 7; s = 99)

in Efficient Computation of Address Sequences in Data Parallel Programs Using Closed Forms for Basis Vectors
by Ashwath Thirumalai, J. Ramanujam

Table 4: Times (in microseconds) for closed form expressions (CF), Loop enumeration (LSU), Rice code, and the Sort approach on an IBM SP-2 (p = 32; s = pk ? 1; s = pk + 1)

in Efficient Computation of Address Sequences in Data Parallel Programs Using Closed Forms for Basis Vectors
by Ashwath Thirumalai, J. Ramanujam
Next 10 →
Results 1 - 10 of 10,695
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University