Romancing the Algorithm: Navigating Constantly, Frequently, and Silently Changing Algorithms for Digital Work.
Vishal SharmaKirsten E. BrayNeha KumarRebecca E. GrinterPublished in: Proc. ACM Hum. Comput. Interact. (2022)
Keyphrases
- learning algorithm
- times faster
- computational cost
- computational complexity
- single pass
- dynamic programming
- significant improvement
- algorithm has been developed
- worst case
- space complexity
- experimental evaluation
- related algorithms
- computationally efficient
- benchmark problems
- synthetic and real datasets
- theoretical analysis
- algorithms require
- synthetic and real world datasets
- classification algorithm
- detection algorithm
- preprocessing
- incremental algorithms
- np hard
- hybrid algorithm
- memory requirements
- recently developed
- computational efficiency
- iterative algorithms
- convergence rate
- highly efficient
- noisy data
- neural network
- incremental version
- optimization algorithm
- image processing algorithms
- computationally intensive
- k means
- exhaustive search
- segmentation algorithm
- simulated annealing
- probabilistic model
- computationally demanding
- digital straight line
- filtering algorithm
- synthetic datasets
- combinatorial optimization
- clustering method
- search space
- optimal solution
- objective function