Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,385,137 papers from all fields of science
Search
Sign In
Create Free Account
Cost efficiency
Known as:
Cost optimality
, Cost optimal
, Cost-efficient
Expand
Cost efficiency (or cost optimality), in the context of parallel computer algorithms, refers to a measure of how effectively parallel computing can…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Algorithm
Dynamic Business Modeling
Parallel computing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Optimized Fairness Cell Selection for 3GPP LTE-A Macro-Pico HetNets
Jun Wang
,
Jianguo Liu
,
Dongyao Wang
,
Jiyong Pang
,
G. Shen
IEEE Vehicular Technology Conference
2011
Corpus ID: 4374381
Pico cell has been brought to cellular networks as a new technology to deliver cost-effective coverage and capacity to hard-to…
Expand
Highly Cited
2011
Highly Cited
2011
Energy-Efficient Multicasting of Scalable Video Streams Over WiMAX Networks
S. Sharangi
,
Ramesh Krishnamurti
,
M. Hefeeda
IEEE transactions on multimedia
2011
Corpus ID: 15096604
The Multicast/Broadcast Service (MBS) feature of mobile WiMAX network is a promising technology for providing wireless multimedia…
Expand
Highly Cited
2010
Highly Cited
2010
Testing TSV-based three-dimensional stacked ICs
E. Marinissen
Design, Automation and Test in Europe
2010
Corpus ID: 15736166
To meet customer's product-quality expectations, each individual IC needs to be tested for manufacturing defects incurred during…
Expand
Highly Cited
2008
Highly Cited
2008
High aspect ratio TSV copper filling with different seed layers
M. J. Wolf
,
Thomas Dretschkow
,
+6 authors
Herbert Reichl
Electronic Components and Technology Conference
2008
Corpus ID: 39265599
The paper addresses the through silicon via (TSV) filling using electrochemical deposition (ECD) of copper. The impact of seed…
Expand
Highly Cited
2008
Highly Cited
2008
The Zurich Trusted Information Channel - An Efficient Defence Against Man-in-the-Middle and Malicious Software Attacks
T. Weigold
,
T. Kramp
,
R. Hermann
,
Frank Höring
,
P. Buhler
,
M. Baentsch
Trust and Trustworthy Computing
2008
Corpus ID: 39290220
This paper introduces the Zurich Trusted Information Channel (ZTIC, for short), a cost-efficient and easy-to-use approach to…
Expand
Highly Cited
2005
Highly Cited
2005
Polymer Electronics Systems - Polytronics
K. Bock
Proceedings of the IEEE
2005
Corpus ID: 23177369
Current trends in the development of electronics systems show that the provision of thin flexible components and semiconductors…
Expand
Highly Cited
2003
Highly Cited
2003
Motion adaptive interpolation with horizontal motion detection for deinterlacing
Shyh-Feng Lin
,
Yu-Ling Chang
,
Liang-Gee Chen
IEEE Trans. Consumer Electron.
2003
Corpus ID: 15975261
A motion adaptive deinterlacing algorithm is presented in this paper. It consists of the ELA-median directional interpolation…
Expand
Highly Cited
1999
Highly Cited
1999
An efficient bandwidth-sharing technique for true video on demand systems
Ying Cai
,
K. Hua
MULTIMEDIA '99
1999
Corpus ID: 16809405
Patching is a cost efficient channel-sharing technique for video-on-demand systems. However, its performance is limited due to…
Expand
Review
1995
Review
1995
Personal communication systems (PCS)
V. Li
,
X. Qiu
Proceedings of the IEEE
1995
Corpus ID: 62151464
Personal communication systems (PCS) represent a rapidly growing and increasingly important segment of the telecommunication…
Expand
Highly Cited
1983
Highly Cited
1983
Within-Plant Distribution of Spider Mites (Acari: Tetranychidae) on Cotton: A Developing Implementable Monitoring Program
L. T. Wilson
,
D. González
,
T. Leigh
,
V. Maggi
,
C. Foristiere
,
P. Goodell
1983
Corpus ID: 83930260
The vertical distribution of spider mites, Tetranychus spp., on cotton is largely determined by the phenological stage of crop…
Expand
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