• Citer

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries

par Bremner, David;Demaine, Erik D. ;Erickson, Jeff J.;Iacono, John ;Langerman, Stefan ;Morin, Pat;Toussaint, Godfried G.
Référence Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings, Springer, Vol. 2748, page (451-461)
Publication Publié, 2003

Publication dans des actes

• Détails

Titre:	Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
Auteur:	Bremner, David; Demaine, Erik D.; Erickson, Jeff J.; Iacono, John; Langerman, Stefan; Morin, Pat; Toussaint, Godfried G.
Informations sur la publication:	Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings, Springer, Vol. 2748, page (451-461)
Statut de publication:	Publié, 2003
series:	Lecture Notes in Computer Science
Sujet CREF:	Théorie des algorithmes
Langue:	Français
Identificateurs:	info:doi/10.1007/978-3-540-45078-8_39