Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,751,480 papers from all fields of science
Search
Sign In
Create Free Account
Incremental computing
Known as:
Increment
, Incremental computation
Incremental computing, also known as incremental computation, is a software feature which, whenever a piece of data changes, attempts to save time by…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Dataflow programming
Dirty bit
Functional reactive programming
Incremental backup
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Efficient Parallel Search Algorithm for Determining Optimal R=1/2 Systematic Convolutional Self-Doubly Orthogonal Codes
G. Kowarzyk
,
N. Bélanger
,
D. Haccoun
,
Y. Savaria
IEEE Transactions on Communications
2013
Corpus ID: 29074244
A novel parallel and implicitly-exhaustive search algorithm for finding, in systematic form, rate R=\frac{1}{2} optimal-span…
Expand
2010
2010
Clustering Algorithm on Data Stream with Skew Distribution Based on Temporal Density: Clustering Algorithm on Data Stream with Skew Distribution Based on Temporal Density
Ning Yang
,
Changjie Tang
,
Yue Wang
,
Yu Chen
,
Jiaoling Zheng
2010
Corpus ID: 61896703
To solve the problem of clustering this paper proposes a concept of temporal density, which reveals a set of mathematical…
Expand
2010
2010
How to enforce non-negative energy dissipation in microplane and other constitutive models for softening damage, plasticity and friction
Z. Bažant
,
Qiang Yu
,
F. Caner
,
G. Cusatis
2010
Corpus ID: 2859402
Material constitutive models must be formulated in such a way that the energy dissipation can never become negative during…
Expand
2006
2006
Distributed link-based ranking in P2P Web retrieval
Jie Wu
2006
Corpus ID: 60725963
One of the main differences between modern search engines and traditional ones is the adoption of link-based ranking algorithm in…
Expand
Review
2004
Review
2004
Combining Memoization and Dynamic Dependence Graphs
Umut A. Acar
,
G. Blelloch
,
R. Harper
2004
Corpus ID: 9575548
Memoization may be reviewed as a mechanism for re-using a computation—if a function is re-applied to the same argument we may re…
Expand
2003
2003
Philosophies and Advances in Scaling Mining Algorithms to Large Databases
P. Bradley
2003
Corpus ID: 17521173
Data mining has become increasingly important as a key to analyzing, digesting and understanding the flood of digital data…
Expand
2002
2002
On use of duration modeling for continuous digits speech recognition
R. Dong
,
Jie Zhu
Interspeech
2002
Corpus ID: 18688850
In this paper, we describe our duration model techniques in HMM based speech recognizer. With this approach, a large amount of…
Expand
Review
1998
Review
1998
Eecient Computation via Incremental Computation
Yanhong A. Liu
1998
Corpus ID: 7794409
Incremental computation takes advantage of repeated computations on inputs that di er slightly from one another, computing each…
Expand
1993
1993
Deriving Incremental
ProgramsYanhong A. Liu
,
T. Teitelbaum
1993
Corpus ID: 17435065
A systematic stepwise transformational approach is given for deriving incremental programs from non-incremental programs. We…
Expand
1992
1992
On the complexity of incremental computation
G. Ramalingam
,
T. Reps
1992
Corpus ID: 59808267
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