David M. Mount
David M. Mount
Professor of Computer Science, University of Maryland
Verifierad e-postadress på cs.umd.edu - Startsida
Titel
Citeras av
Citeras av
År
An efficient k-means clustering algorithm: Analysis and implementation
T Kanungo, DM Mount, NS Netanyahu, CD Piatko, R Silverman, AY Wu
IEEE transactions on pattern analysis and machine intelligence 24 (7), 881-892, 2002
50762002
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
S Arya, DM Mount, NS Netanyahu, R Silverman, AY Wu
Journal of the ACM (JACM) 45 (6), 891-923, 1998
33181998
Handbook of discrete and computational geometry
CD Toth, J O'Rourke, JE Goodman
Chapman and Hall/CRC, 2017
15502017
The discrete geodesic problem
JSB Mitchell, DM Mount, CH Papadimitriou
SIAM Journal on Computing 16 (4), 647-668, 1987
7091987
A local search approximation algorithm for k-means clustering
T Kanungo, DM Mount, NS Netanyahu, CD Piatko, R Silverman, AY Wu
Proceedings of the eighteenth annual symposium on Computational geometry, 10-18, 2002
6042002
Approximate Nearest Neighbor Queries in Fixed Dimensions.
S Arya, DM Mount
SODA 93, 271-280, 1993
5201993
ANN: A library for approximate nearest neighbor searching
DM Mount
http://www. cs. umd. edu/~ mount/ANN/, 2010
4432010
An output-sensitive algorithm for computing visibility graphs
SK Ghosh, DM Mount
SIAM Journal on Computing 20 (5), 888-910, 1991
3831991
Algorithms for facility location problems with outliers
M Charikar, S Khuller, DM Mount, G Narasimhan
Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms …, 2001
3532001
Euclidean spanners: short, thin, and lanky
S Arya, G Das, DM Mount, JS Salowe, M Smid
Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995
2271995
Isomorphism of graphs with bounded eigenvalue multiplicity
L Babai, DY Grigoryev, DM Mount
Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982
2261982
Algorithms for fast vector quantization
S Arya, DM Mount
[Proceedings] DCC93: Data Compression Conference, 381-390, 1993
2131993
Efficient algorithms for robust feature matching
DM Mount, NS Netanyahu, J Le Moigne
Pattern recognition 32 (1), 17-38, 1999
1991999
A fast implementation of the ISODATA clustering algorithm
N Memarsadeghi, DM Mount, NS Netanyahu, J Le Moigne
International Journal of Computational Geometry & Applications 17 (01), 71-103, 2007
1902007
The analysis of a simple k-means clustering algorithm
T Kanungo, DM Mount, NS Netanyahu, C Piatko, R Silverman, AY Wu
Proceedings of the sixteenth annual symposium on Computational geometry, 100-109, 2000
1432000
Approximate range searching
S Arya, DM Mount
Computational Geometry 17 (3-4), 135-152, 2000
1312000
A point-placement strategy for conforming Delaunay tetrahedralization
M Murphy, DM Mount, CW Gable
International Journal of Computational Geometry & Applications 11 (06), 669-682, 2001
1232001
Data structures and algorithms in C++
MT Goodrich, R Tamassia, DM Mount
John Wiley & Sons, 2011
1202011
Accounting for boundary effects in nearest-neighbor searching
S Arya, DM Mount, O Narayan
Discrete & Computational Geometry 16 (2), 155-176, 1996
1011996
It’s okay to be skinny, if your friends are fat
S Maneewongvatana, DM Mount
Center for Geometric Computing 4th Annual Workshop on Computational Geometry …, 1999
971999
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20