Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,275,344 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.
Highly Cited
2019
Highly Cited
2019
Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks
Nils Reimers
,
Iryna Gurevych
Conference on Empirical Methods in Natural…
2019
Corpus ID: 201646309
BERT (Devlin et al., 2018) and RoBERTa (Liu et al., 2019) has set a new state-of-the-art performance on sentence-pair regression…
Expand
Highly Cited
2018
Highly Cited
2018
CBAM: Convolutional Block Attention Module
Sanghyun Woo
,
Jongchan Park
,
Joon-Young Lee
,
In-So Kweon
European Conference on Computer Vision
2018
Corpus ID: 49867180
We propose Convolutional Block Attention Module (CBAM), a simple yet effective attention module for feed-forward convolutional…
Expand
Highly Cited
2017
Highly Cited
2017
Mask R-CNN
Kaiming He
,
Georgia Gkioxari
,
Piotr Dollár
,
Ross B. Girshick
2017
Corpus ID: 54465873
We present a conceptually simple, flexible, and general framework for object instance segmentation. Our approach efficiently…
Expand
Highly Cited
2017
Highly Cited
2017
Automatic differentiation in PyTorch
Adam Paszke
,
Sam Gross
,
+7 authors
Adam Lerer
2017
Corpus ID: 40027675
In this article, we describe an automatic differentiation module of PyTorch — a library designed to enable rapid research on…
Expand
Highly Cited
2012
Highly Cited
2012
ADADELTA: An Adaptive Learning Rate Method
Matthew D. Zeiler
arXiv.org
2012
Corpus ID: 7365802
We present a novel per-dimension learning rate method for gradient descent called ADADELTA. The method dynamically adapts over…
Expand
Highly Cited
2010
Highly Cited
2010
Noncooperative Cellular Wireless with Unlimited Numbers of Base Station Antennas
T. Marzetta
IEEE Transactions on Wireless Communications
2010
Corpus ID: 17201716
A cellular base station serves a multiplicity of single-antenna terminals over the same time-frequency interval. Time-division…
Expand
Highly Cited
2008
Highly Cited
2008
Cloud computing — Issues, research and implementations
M. Vouk
International Conference on Information…
2008
Corpus ID: 16230881
ldquoCloudrdquo computing - a relatively recent term, builds on decades of research in virtualization, distributed computing…
Expand
Highly Cited
2003
Highly Cited
2003
Ad hoc On-Demand Distance Vector (AODV) Routing
C. Perkins
,
E. Belding-Royer
,
Samir R Das
Request for Comments
2003
Corpus ID: 15231054
The Ad hoc On-Demand Distance Vector (AODV) routing protocol is intended for use by mobile nodes in an ad hoc network. It offers…
Expand
Highly Cited
2003
Highly Cited
2003
Optimized Link State Routing Protocol (OLSR)
T. Clausen
,
P. Jacquet
Request for Comments
2003
Corpus ID: 44711941
This document describes the Optimized Link State Routing (OLSR) protocol for mobile ad hoc networks. The protocol is an…
Expand
Highly Cited
1994
Highly Cited
1994
Dynamic Source Routing in Ad Hoc Wireless Networks
David B. Johnson
,
D. Maltz
Mobidata Workshops
1994
Corpus ID: 131561
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established…
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