Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,984,613 papers from all fields of science
Search
Sign In
Create Free Account
Overhead (computing)
Known as:
Computational overhead
, Overhead
In computer science, overhead is any combination of excess or indirect computation time, memory, bandwidth, or other resources that are required to…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Algorithm
Algorithmic efficiency
BareMetal
Block (data storage)
Expand
Broader (1)
Software engineering
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2012
Review
2012
Demo: Medusa: a programming framework for crowd-sensing applications
Moo-Ryong Ra
,
B. Liu
,
T. L. Porta
,
R. Govindan
ACM SIGMOBILE International Conference on Mobile…
2012
Corpus ID: 52836419
The ubiquity of smartphones and their on-board sensing capabilities motivates crowd-sensing, a capability that harnesses the…
Expand
Highly Cited
2009
Highly Cited
2009
BodyMAC: Energy efficient TDMA-based MAC protocol for Wireless Body Area Networks
Gengfa Fang
,
E. Dutkiewicz
9th International Symposium on Communications and…
2009
Corpus ID: 17838338
Wireless Body Area Networks (WBANs) enable placement of tiny biomedical sensors on or inside the human body to monitor vital body…
Expand
Highly Cited
2008
Highly Cited
2008
Sliding-Windows for Rapid Object Class Localization: A Parallel Technique
C. Wojek
,
Gyuri Dorkó
,
A. Schulz
,
B. Schiele
DAGM-Symposium
2008
Corpus ID: 37286148
This paper presents a fast object class localization framework implemented on a data parallel architecture currently available in…
Expand
Highly Cited
2007
Highly Cited
2007
Shortcut Tree Routing in ZigBee Networks
Taehong Kim
,
Daeyoung Kim
,
Noseong Park
,
Seong-eun Yoo
,
T. López
International Symposium on Wireless Pervasive…
2007
Corpus ID: 9595553
ZigBee is the emerging industrial standard for ad hoc networks based on IEEE 802.15.4. Due to characteristics such as low data…
Expand
Highly Cited
2006
Highly Cited
2006
CFI-Stream: mining closed frequent itemsets in data streams
Nan Jiang
,
L. Gruenwald
Knowledge Discovery and Data Mining
2006
Corpus ID: 11209609
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation…
Expand
Highly Cited
2004
Highly Cited
2004
A leakage reduction methodology for distributed MTCMOS
B. Calhoun
,
Frank Honoré
,
A. Chandrakasan
IEEE Journal of Solid-State Circuits
2004
Corpus ID: 1589585
Multithreshold CMOS (MTCMOS) circuits reduce standby leakage power with low delay overhead. Most MTCMOS designs cut off the power…
Expand
Highly Cited
2003
Highly Cited
2003
RTOS modeling for system level design
A. Gerstlauer
,
Haobo Yu
,
D. Gajski
Design, Automation and Test in Europe Conference…
2003
Corpus ID: 15638
System level synthesis is widely seen as the solution for closing the productivity gap in system design. High level system models…
Expand
Highly Cited
1997
Highly Cited
1997
Skew-tolerant domino circuits
David L. Harris
,
M. Horowitz
IEEE International Solids-State Circuits…
1997
Corpus ID: 1387405
As cycle time of chips shrinks and die size grows, clock skew measured as a fraction of the cycle time is increasing. Traditional…
Expand
Highly Cited
1995
Highly Cited
1995
AIRMAIL: A link-layer protocol for wireless networks
E. Ayanoglu
,
S. Paul
,
T. L. Porta
,
Krishan K. Sabnani
,
R. Gitlin
Wirel. Networks
1995
Corpus ID: 253563
This paper describes the design and performance of a link-layer protocol for indoor and outdoor wireless networks. The protocol…
Expand
Highly Cited
1990
Highly Cited
1990
Serial interfacing for embedded-memory testing
B. Nadeau-Dostie
,
A. Silburt
,
V. Agarwal
IEEE Design & Test of Computers
1990
Corpus ID: 21277283
A serial interfacing scheme in which several embedded memories share the built-in, self-test circuit is presented. For external…
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