Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

12 relations
Dataflow programmingDirty bitFunctional reactive programmingIncremental backup
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
IncApprox: A Data Analytics System for Incremental Approximate Computing
Incremental and approximate computations are increasingly being adopted for data analytics to achieve low-latency execution and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Differential Dataflow
Existing computational models for processing continuously changing input data are unable to efficiently support iterative queries… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Relational Verification Using Product Programs
Relational program logics are formalisms for specifying and verifying properties about two programs or two runs of the same… Expand
  • figure 3
Is this relevant?
Highly Cited
2011
Highly Cited
2011
A platform for scalable one-pass analytics using MapReduce
Today's one-pass analytics applications tend to be data-intensive in nature and require the ability to process high volumes of… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Coupled Detection and Trajectory Estimation for Multi-Object Tracking
We present a novel approach for multi-object tracking which considers object detection and spacetime trajectory estimation as a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Location-based spatial queries
In this paper we propose an approach that enables mobile clients to determine the validity of previous queries based on their… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2000
2000
A data-warehouse/OLAP framework for scalable telecommunication tandem traffic analysis
In a telecommunication network, hundreds of millions of call detail records (CDRs) are generated daily. Applications such as… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Structure from motion without correspondence
A method is presented to recover 3D scene structure and camera motion from multiple images without the need for correspondence… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
On the Computational Complexity of Dynamic Graph Problems
Abstract A common way to evaluate the time complexity of an algorithm is to use asymptotic worst-case analysis and to express the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
A categorized bibliography on incremental computation
In many kinds of emnputatiomd contexts, modifications of the input data are to be processed at once so as to have immediate… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE