Prati
David M. Mount
David M. Mount
Professor of Computer Science, University of Maryland
Potvrđena adresa e-pošte na cs.umd.edu - Početna stranica
Naslov
Citirano
Citirano
Godina
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
73842002
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
39531998
The discrete geodesic problem
JSB Mitchell, DM Mount, CH Papadimitriou
SIAM Journal on Computing 16 (4), 647-668, 1987
9401987
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
9082002
Approximate nearest neighbor queries in fixed dimensions.
S Arya, DM Mount
SODA 93, 271-280, 1993
6541993
Algorithms for facility location problems with outliers
M Charikar, S Khuller, DM Mount, G Narasimhan
SODA 1, 642-651, 2001
5472001
ANN: A library for approximate nearest neighbor searching
DM Mount
http://www. cs. umd. edu/~ mount/ANN/, 2010
5302010
An output-sensitive algorithm for computing visibility graphs
SK Ghosh, DM Mount
SIAM Journal on Computing 20 (5), 888-910, 1991
4951991
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
2872007
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
2791982
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
2721995
Algorithms for fast vector quantization
S Arya, DM Mount
[Proceedings] DCC93: Data Compression Conference, 381-390, 1993
2531993
Efficient algorithms for robust feature matching
DM Mount, NS Netanyahu, J Le Moigne
Pattern recognition 32 (1), 17-38, 1999
2351999
WU AY: An efficient k-means clustering algorithm: Analysis and implementation
T Kanungo, DM Mount, NS Netanyahu, CD Piatko, R Silverman
IEEE Trans. Pattern Anal. Mach. Intell 24 (7), 881-892, 2002
2252002
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
1932000
Analysis of approximate nearest neighbor searching with clustered point sets
S Maneewongvatana, DM Mount
arXiv preprint cs/9901013, 1999
1791999
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
1731999
Approximate range searching
S Arya, DM Mount
Computational Geometry 17 (3-4), 135-152, 2000
1602000
Data structures and algorithms in C++
MT Goodrich, R Tamassia, DM Mount
John Wiley & Sons, 2011
1532011
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
1512001
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20