Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,751,673 papers from all fields of science
Search
Sign In
Create Free Account
Data dependency
Known as:
Data-dependent
, Data dependence
, Data dependencies
Expand
A data dependency in computer science is a situation in which a program statement (instruction) refers to the data of a preceding statement. In…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
25 relations
Broader (1)
Analysis of parallel algorithms
Blocking (computing)
Computer science
Control flow graph
Cyrix 6x86
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Description-Discrimination Collaborative Tracking
Dapeng Chen
,
Zejian Yuan
,
G. Hua
,
Yang Wu
,
Nanning Zheng
European Conference on Computer Vision
2014
Corpus ID: 6080885
Appearance model is one of the most important components for online visual tracking. An effective appearance model needs to…
Expand
2008
2008
Robust clustering analysis for the management of self-monitoring distributed systems
Andres Quiroz
,
N. Gnanasambandam
,
M. Parashar
,
Naveen Sharma
Cluster Computing
2008
Corpus ID: 2015476
We present a decentralized algorithm for online clustering analysis used for anomaly detection in self-monitoring distributed…
Expand
2005
2005
Alleviating the data memory bandwidth bottleneck in coarse-grained reconfigurable arrays
G. Dimitroulakos
,
M. Galanis
,
C. Goutis
IEEE International Conference on Application…
2005
Corpus ID: 15621746
It is widely known that parallel operation execution in multiprocessor systems generates a respective increase in memory accesses…
Expand
Review
2002
Review
2002
New paradigm for signal paths in ATE pin electronics are needed for serialcom device testing
Masashi Shimanouchi
Proceedings. International Test Conference
2002
Corpus ID: 42081870
Signal paths in ATE pin electronics need a fresh examination in order to address the challenges of serial data communication…
Expand
1998
1998
Multiresolution Based on Weighted Averages of the Hat Function II: Nonlinear Reconstruction Techniques
F. Aràndiga
,
R. Donat
,
A. Harten
SIAM Journal on Scientific Computing
1998
Corpus ID: 2926563
In this paper we describe and analyze a class of nonlinear \mr schemes for the multiresolution setting which corresponds to…
Expand
1997
1997
Improved Detection For Magnetic Recording Systems With Media Noise
Joseph Peter Caroselli
,
S. A. Altekar
,
P. McEwen
,
J. K. Wolf
IEEE International Magnetics Conference
1997
Corpus ID: 42451727
In this paper, data-dependent partial local feedback noise prediction schemes will be considered for magnetic recording…
Expand
1991
1991
Regularized fast recursive least squares algorithms for adaptive filtering
A. Houacine
IEEE Transactions on Signal Processing
1991
Corpus ID: 1987976
Fast recursive least squares (FRLS) algorithms are developed by using factorization techniques which represent an alternative way…
Expand
1989
1989
Modelling thin-film storage channels
K. Fisher
,
J. Cioffi
International Magnetics Conference
1989
Corpus ID: 37027436
A straightforward method for modeling nonlinearity and data-dependent (transition-dependent) media noise in a thin-film storage…
Expand
Highly Cited
1988
Highly Cited
1988
Process and dataflow control in distributed data-intensive systems
W. Alexander
,
G. Copeland
ACM SIGMOD Conference
1988
Corpus ID: 17683665
In dataflow architectures, each dataflow operation is typically executed on a single physical node. We are concerned with…
Expand
1977
1977
Likelihood ratios for sequential hypothesis testing on Markov sequences
L. Scharf
,
L. Nolte
IEEE Transactions on Information Theory
1977
Corpus ID: 206732929
A variety of likelihood ratios are derived for detecting Gauss-Markov and finite-state Markov sequences in additive Gaussian…
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