Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,617,828 papers from all fields of science
Search
Sign In
Create Free Account
Benchmark (computing)
Known as:
Bench mark program
, Benchmark program
, CPU benchmark
Expand
In computing, a benchmark is the act of running a computer program, a set of programs, or other operations, in order to assess the relative…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
3DMark
Algorithmic efficiency
Analysis of algorithms
BogoMips
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Minimum Error Bounded Efficient L1 Tracker with Occlusion Detection (PREPRINT)
Xue Mei
,
Haibin Ling
,
Yi Wu
,
Erik Blasch
,
L. Bai
2011
Corpus ID: 60019217
Abstract : Recently, sparse representation has been applied to visual tracking to find the target with the minimum reconstruction…
Expand
Highly Cited
2008
Highly Cited
2008
Ontology Matching with CIDER: Evaluation Report for the OAEI 2008
J. Gracia
,
E. Mena
Organizational Memories
2008
Corpus ID: 1618499
Ontology matching, the task of determining relations that hold among terms of two different ontologies, is a key issue in the…
Expand
Highly Cited
2004
Highly Cited
2004
Intelligent data engineering and automated learning - IDEAL 2004 : 5th International Conference, Exeter, UK, August 25-27, 2004 : proceedings
Z. Yang
,
R. Everson
,
Hujun Yin
2004
Corpus ID: 19994273
Bioinformatics.- Modelling and Clustering of Gene Expressions Using RBFs and a Shape Similarity Metric.- A Novel Hybrid GA/SVM…
Expand
Highly Cited
2001
Highly Cited
2001
Designing LDPC codes using bit-filling
J. Campello
,
D. Modha
,
S. Rajagopalan
ICC . IEEE International Conference on…
2001
Corpus ID: 15621846
Bipartite graphs of bit nodes and parity check nodes arise as Tanner graphs corresponding to low density parity check codes…
Expand
Highly Cited
1999
Highly Cited
1999
Low Power BIST by Filtering Non-Detecting Vectors
S. Manich
,
A. Gabarró
,
+7 authors
Marcelino B. Santos
European Test Workshop (Cat. No.PR00390)
1999
Corpus ID: 17848007
In this paper, two techniques to reduce the energy and the average power consumption of the system are proposed. They are based…
Expand
Highly Cited
1998
Highly Cited
1998
A test pattern generation methodology for low power consumption
Fulvio Corno
,
P. Prinetto
,
M. Rebaudengo
,
M. Reorda
Proceedings of the ... IEEE VLSI Test Symposium
1998
Corpus ID: 10337214
This paper proposes an ATPG technique that reduces power dissipation during the test of sequential circuits. The proposed…
Expand
Highly Cited
1998
Highly Cited
1998
A new class of compact schemes
R. Hixon
1998
Corpus ID: 123869421
A new class of compact schemes are derived that obtain high-order accuracy while using a very small stencil size. These schemes…
Expand
Highly Cited
1995
Highly Cited
1995
Benchmark full configuration interaction calculations on the helium dimer
T. Mourik
,
J. -. Lenthe
1995
Corpus ID: 95553931
Full configuration interaction calculations are presented for the helium dimer employing large basis sets. Using the best basis…
Expand
Highly Cited
1992
Highly Cited
1992
HOPE: an efficient parallel fault simulator
H. K. Lee
,
D. S. Ha
[] Proceedings 29th ACM/IEEE Design Automation…
1992
Corpus ID: 58690153
The authors present an efficient sequential circuit parallel fault simulator, HOPE, which simulates 32 faults at a time. HOPE is…
Expand
Highly Cited
1966
Highly Cited
1966
PHYSBE ... a physiological simulation benchmark experiment
J. McLeod
1966
Corpus ID: 62695440
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