Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,279,467 papers from all fields of science
Search
Sign In
Create Free Account
Memory bound function
Known as:
Memory bound
, Memory function
Memory bound refers to a situation in which the time to complete a given computational problem is decided primarily by the amount of memory required…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
21 relations
Algorithm
Computational problem
CryptoNote
Cynthia Dwork
Expand
Broader (2)
Analysis of algorithms
Computer memory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
A 3D-stacked logic-in-memory accelerator for application-specific data intensive computing
Qiuling Zhu
,
Berkin Akin
,
+4 authors
F. Franchetti
IEEE International Conference on 3D System…
2013
Corpus ID: 11850216
This paper introduces a 3D-stacked logic-in-memory (LiM) system that integrates the 3D die-stacked DRAM architecture with the…
Expand
Highly Cited
2011
Highly Cited
2011
Communicative and Cultural Memory
J. Assmann
2011
Corpus ID: 13714209
Like consciousness and language, human memory is acquired through communication, socialization, and acculturation. It is…
Expand
Highly Cited
2010
Highly Cited
2010
Slow-wave sleep takes the leading role in memory reorganization
S. Diekelmann
,
J. Born
Nature Reviews Neuroscience
2010
Corpus ID: 43830909
We recently proposed a comprehensive framework for sleep-dependent memory consolidation suggesting that, during slowwave sleep…
Expand
Highly Cited
2005
Highly Cited
2005
Automatic Feature Extraction for Classifying Audio Data
Ingo Mierswa
,
K. Morik
Machine-mediated learning
2005
Corpus ID: 8550617
Today, many private households as well as broadcasting or film companies own large collections of digital music plays. These are…
Expand
Highly Cited
2003
Highly Cited
2003
Rate Monotonic Analysis: The Hyperbolic Bound
Enrico Bini
,
G. Buttazzo
,
G. Buttazzo
IEEE Trans. Computers
2003
Corpus ID: 547129
We propose a novel schedulability analysis for verifying the feasibility of large periodic task sets under the rate monotonic…
Expand
Review
2002
Review
2002
Role of polyamines in the ontogeny of plants and their biotechnological applications
Harsh Pal Bais
,
Gokare A. Ravishankar
Plant Cell Tissue and Organ Culture
2002
Corpus ID: 28556360
Recent developments in the metabolism and function of polyamines in plants is presented. Polyamines appear to be involved in a…
Expand
Highly Cited
2001
Highly Cited
2001
Dynamic speculative precomputation
Jamison D. Collins
,
D. Tullsen
,
Hong Wang
,
John Paul Shen
Proceedings. 34th ACM/IEEE International…
2001
Corpus ID: 12494330
A large number of memory accesses in memory-bound applications are irregular, such as pointer dereferences, and can be…
Expand
Highly Cited
1998
Highly Cited
1998
Anytime Coalition Structure Generation with Worst Case Guarantees
T. Sandholm
,
K. Larson
,
Martin Andersson
,
Onn Shehory
,
F. Tohmé
AAAI/IAAI
1998
Corpus ID: 1515588
Coalition formation is a key topic in multiagent systems. One would prefer a coalition structure that maximizes the sum of the…
Expand
Highly Cited
1998
Highly Cited
1998
Anti-HIV-1 and chemotactic activities of human stromal cell-derived factor 1α (SDF-1α) and SDF-1β are abolished by CD26/dipeptidyl peptidase IV-mediated cleavage
T. Shioda
,
H. Kato
,
+12 authors
Y. Nagai
1998
Corpus ID: 22473674
CD26 is a leukocyte-activation antigen that is expressed on T lymphocytes and macrophages and possesses dipeptidyl peptidase IV…
Expand
Highly Cited
1968
Highly Cited
1968
Viscoelastic properties of fine-grained incompressible turbulence
S. Crow
Journal of Fluid Mechanics
1968
Corpus ID: 54064708
A number of shear-flow phenomena can be explained qualitatively if turbulence is regarded as a continuous viscoelastic medium…
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