设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
SpringerLink电子期刊(5)
Elsevier电子期刊(5)
在“
Elsevier电子期刊
”中,
命中:
5
条,耗时:小于0.01 秒
在所有数据库中总计命中:
10
条
1.
A hierarchical aggregation model to achieve visualization scalability in the analysis of parallel applications
作者:
Lucas Mello Schnorr
a
;
b
;
lmschnorr@inf.ufrgs.br
;
Guillaume
Huard
b
;
Guillaume
.
Huard
@imag.fr
;
Philippe Olivier Alexandre Navaux
a
;
navaux@inf.ufrgs.br
关键词:
Grid computing
;
Trace visualization
;
Large-scale application analysis
;
Aggregation and reduction algorithms
;
Treemaps
刊名:Parallel Computing
出版年:2012
2.
Triva: Interactive 3D visualization for performance analysis of parallel applications
作者:
Lucas Mello Schnorr
;
Guillaume
Huard
;
Philippe O.A. Navaux
关键词:
Grid computing
;
Parallel application analysis
;
Parallel program visualization
;
Behavioral visualization
刊名:Future Generation Computer Systems
出版年:2010
3.
Bayesian copula selection
作者:
David
Huard
;
Guillaume
É
;
vin and Anne-Catherine Favre
关键词:
Copulas
;
Model selection
;
Bayes’
;
theorem
;
Goodness-of-fit test
;
Kendall's tau
;
Pseudo-likelihood
刊名:Computational Statistics and Data Analysis
出版年:2006
4.
Multivariate Padé approximation
作者:
Guillaume
;
Philippe
;
Huard
;
Alain
关键词:
41A21
;
41A63
;
65D15
;
Multivariate Padé
;
approximants
;
Convergence of multivariate Padé
;
approximants
;
Homogeneous approximants
;
Nonhomogeneous approximants
;
Padé
;
Padé
;
ap
刊名:Journal of Computational and Applied Mathematics
出版年:2000
5.
Generalized Multivariate Padé Approximants
作者:
Guillaume
;
Philippe
;
Huard
;
Alain
;
Robin
;
Vincent
刊名:Journal of Approximation Theory
出版年:1998
1
按检索点细分(5)
作者(5)
按出版年细分(5)
2012年(1)
2010年(1)
2006年(1)
2000年(1)
2000年及以前(1)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.