Near neighbor searching with K nearest references

dc.creatorEDGAR LEONEL CHAVEZ GONZALEZ
dc.creatorMario Graff
dc.creatorGonzalo Navarro
dc.creatorERIC SADIT TELLEZ AVILA
dc.date2015
dc.date.accessioned2018-11-19T13:46:03Z
dc.date.available2018-11-19T13:46:03Z
dc.identifierhttp://infotec.repositorioinstitucional.mx/jspui/handle/1027/215
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/2251224
dc.descriptionProximity searching is the problem of retrieving,from agiven data base,those objects closest to aquery.To avoid exhaustive searching, data structures called indexes are builton the data base prior to serving queries.The curse of dimensionality is awell-known problem for indexes: in spaces with sufficiently concentrated distance histograms,no index out performs anexhaustive scan of the data base.
dc.formatapplication/pdf
dc.languageeng
dc.publisherInformation Systems 51
dc.publisherElsevier
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/4.0
dc.subjectinfo:eu-repo/classification/LEM/Tecnologías de la Información y Comunicación
dc.subjectinfo:eu-repo/classification/cti/7
dc.subjectinfo:eu-repo/classification/cti/33
dc.subjectinfo:eu-repo/classification/cti/3399
dc.subjectinfo:eu-repo/classification/cti/339999
dc.titleNear neighbor searching with K nearest references
dc.typeArtículos de revistas
dc.audienceresearchers


Este ítem pertenece a la siguiente institución