Optimal Expected-Time Algorithms for Closest Point Problems

ACM Transactions on Mathematical Software - United States
doi 10.1145/355921.355927
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computing Machinery (ACM)

Related search

Ultrafast Expected Time Parallel Algorithms

Journal of Algorithms
1998English

Near-Optimal Sublinear Time Algorithms for Ulam Distance

2010English

An Optimal Basis Identification Technique for Interior-Point Linear Programming Algorithms

1990English

Interior-Point Algorithms, Penalty Methods and Equilibrium Problems

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2006English

Analysis of Two Parareal Algorithms for Time-Periodic Problems

SIAM Journal of Scientific Computing
Computational MathematicsApplied Mathematics
2013English

Linear Time Algorithms for Clustering Problems in Any Dimensions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

English

Sublinear-Time Parallel Algorithms for Matching and Related Problems

1988English

Adjoint-Based Optimal Control of the Expected Exit Time for Stochastic Hybrid Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy