Các bài viết có thể truy cập công khai - David M. MountTìm hiểu thêm
Không có ở bất kỳ nơi nào: 4
Computational geometry: Proximity and location
S Arya, DM Mount
Handbook of Data Structures and Applications, 1027-1042, 2018
Các cơ quan ủy nhiệm: US National Science Foundation, Research Grants Council, Hong Kong
A game-theoretic approach for minimizing delays in autonomous intersections
RP Adkins, DM Mount, AA Zhang
Traffic and Granular Flow'17 12, 131-139, 2019
Các cơ quan ủy nhiệm: US National Science Foundation
On efficient shortest path computation on terrain surface: A direction-oriented approach
VJ Wei, RCW Wong, C Long, DM Mount, H Samet
IEEE Transactions on Knowledge and Data Engineering, 2024
Các cơ quan ủy nhiệm: US National Science Foundation
New Directions in Approximate Nearest-Neighbor Searching
DM Mount
Algorithms and Discrete Applied Mathematics: 5th International Conference …, 2019
Các cơ quan ủy nhiệm: US National Science Foundation
Có tại một số nơi: 16
Optimal approximate polytope membership
S Arya, GD da Fonseca, DM Mount
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
Các cơ quan ủy nhiệm: US National Science Foundation, Research Grants Council, Hong Kong
On the combinatorial complexity of approximating polytopes
S Arya, GD Da Fonseca, DM Mount
Discrete & Computational Geometry 58, 849-870, 2017
Các cơ quan ủy nhiệm: US National Science Foundation, Research Grants Council, Hong Kong
Optimal bound on the combinatorial complexity of approximating polytopes
R Arya, S Arya, GD da Fonseca, D Mount
ACM Transactions on Algorithms 18 (4), 1-29, 2022
Các cơ quan ủy nhiệm: US National Science Foundation, Agence Nationale de la Recherche, Research …
Economical Delone sets for approximating convex bodies
A Abdelkader, DM Mount
16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 4 …, 2018
Các cơ quan ủy nhiệm: US National Science Foundation
A fast and simple algorithm for computing approximate Euclidean minimum spanning trees
S Arya, DM Mount
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
Các cơ quan ủy nhiệm: US National Science Foundation, Research Grants Council, Hong Kong
A practical approximation algorithm for the LTS estimator
DM Mount, NS Netanyahu, CD Piatko, AY Wu, R Silverman
Computational Statistics & Data Analysis 99, 148-170, 2016
Các cơ quan ủy nhiệm: US National Science Foundation
Approximate nearest neighbor searching with non-Euclidean and weighted distances
A Abdelkader, S Arya, GD da Fonseca, DM Mount
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Các cơ quan ủy nhiệm: US National Science Foundation, European Commission, Research Grants Council …
Distance oracle on terrain surface
VJ Wei, RCW Wong, C Long, DM Mount
Proceedings of the 2017 ACM International Conference on Management of Data …, 2017
Các cơ quan ủy nhiệm: US National Science Foundation, Research Grants Council, Hong Kong
Economical convex coverings and applications
S Arya, GD da Fonseca, DM Mount
SIAM Journal on Computing 53 (4), 1002-1038, 2024
Các cơ quan ủy nhiệm: Agence Nationale de la Recherche, Research Grants Council, Hong Kong
Proximity queries on terrain surface
VJ Wei, RCW Wong, C Long, D Mount, H Samet
ACM Transactions on Database Systems 47 (4), 1-59, 2022
Các cơ quan ủy nhiệm: US National Science Foundation
Guarantees on nearest-neighbor condensation heuristics
A Flores-Velazco, D Mount
Computational Geometry 95, 101732, 2021
Các cơ quan ủy nhiệm: US National Science Foundation
Approximate geometric MST range queries
S Arya, DM Mount, E Park
31st International Symposium on Computational Geometry (SoCG 2015), 781-795, 2015
Các cơ quan ủy nhiệm: Research Grants Council, Hong Kong
Boundary-sensitive approach for approximate nearest-neighbor classification
A Flores-Velazco, DM Mount
29th Annual European Symposium on Algorithms (ESA 2021), 44: 1-44: 15, 2021
Các cơ quan ủy nhiệm: US National Science Foundation
Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions
FB Atalay, DM Mount
Computational Geometry 79, 14-29, 2019
Các cơ quan ủy nhiệm: US National Science Foundation
Online algorithms for warehouse management
P Dasler, DM Mount
30th International Symposium on Algorithms and Computation (ISAAC 2019), 56 …, 2019
Các cơ quan ủy nhiệm: US National Science Foundation
Modular Circulation and Applications to Traffic Management
P Dasler, DM Mount
Algorithmica 81 (10), 4098-4117, 2019
Các cơ quan ủy nhiệm: US National Science Foundation
Chương trình máy tính sẽ tự động xác định thông tin xuất bản và thông tin về nhà tài trợ