Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 222,812,162 papers from all fields of science
Search
Sign In
Create Free Account
PARAM
Known as:
PARAM 10000
PARAM is a series of supercomputers designed and assembled by the Centre for Development of Advanced Computing (C-DAC) in Pune, India. The latest…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
AIX
Benchmark (computing)
Byte
Clos network
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
Feasible Diversion and Instream Flow Release Using Range of Variability Approach
J. Shiau
,
Fu‐Chun Wu
2004
Corpus ID: 110177364
A methodology based on the range of variability approach (RVA) is presented for determining the feasible combinations of flow…
Expand
2003
2003
Fluorescence quenching with exponential distance dependence: Application to the external heavy-atom effect
M. Rae
,
A. Fedorov
,
M. Berberan-Santos
2003
Corpus ID: 98405702
A model for fluorescence quenching with exponential distance dependence is developed and applied to external heavy-atom quenching…
Expand
Highly Cited
2002
Highly Cited
2002
Solving the Geometric Design Problem of Spatial 3R Robot Manipulators Using Polynomial Homotopy Continuation
Eric Lee
,
C. Mavroidis
2002
Corpus ID: 17584821
In this paper, the geometric design problem of serial-link robot manipulators with three revolute (R) joints is solved using a…
Expand
1999
1999
Quasi-invariance of the gamma process and multiplicative properties of the Poisson-Dirichlet measures
N. Tsilevich
,
A. Vershik
1999
Corpus ID: 16759607
Highly Cited
1998
Highly Cited
1998
Data-driven environmental compensation for speech recognition: A unified approach
P. Moreno
,
B. Raj
,
R. Stern
Speech Communication
1998
Corpus ID: 34119974
Highly Cited
1998
Highly Cited
1998
A new cluster algorithm for graphs
S. Dongen
1998
Corpus ID: 122803929
A new cluster algorithm for graphs called the \emph{Markov Cluster algorithm} ($MCL$ algorithm) is introduced. The graphs may be…
Expand
Highly Cited
1996
Highly Cited
1996
Approximation spline de la prvision d'un processus fonctionnel autorgressif d'ordre 1
Philippe C. Besse
,
H. Cardot
1996
Corpus ID: 116498754
ABSTRACT We present a method to approximate and forecast, on an entire interval, a continuous-time process. For this purpose, we…
Expand
Highly Cited
1991
Highly Cited
1991
Stochastic representation of semantic structure for speech understanding
R. Pieraccini
,
E. Levin
Speech Communication
1991
Corpus ID: 30879862
1990
1990
A quantitative comparison of edge-preserving smoothing techniques
J. du Buf
,
T.G. Campbell
Signal Processing
1990
Corpus ID: 205048877
1985
1985
Is the DTW "distance" really a metric? An algorithm reducing the number of DTW comparisons in isolated word recognition
E. Vidal
,
F. Casacuberta
,
H. Segovia
Speech Communication
1985
Corpus ID: 1062713
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE