Artboard 33Artboard 16Artboard 18Artboard 13Artboard 42Artboard 21Artboard 4Artboard 5Artboard 45Artboard 22Artboard 7Artboard 42Artboard 23Artboard 12Artboard 28Artboard 17?Artboard 28Artboard 43Artboard 49Artboard 47Artboard 15Artboard 32Artboard 6Artboard 22Artboard 5Artboard 25Artboard 1Artboard 42Artboard 11Artboard 41Artboard 11Artboard 23Artboard 10Artboard 4Artboard 9Artboard 6Artboard 8Artboard 7Artboard 3Artboard 12Artboard 25Artboard 34Artboard 43Artboard 44Artboard 16Artboard 24Artboard 13Artboard 5Artboard 24Artboard 31Artboard 1Artboard 12Artboard 27Artboard 30Artboard 36Artboard 44Artboard 9Artboard 17Artboard 6Artboard 27Artboard 30Artboard 29Artboard 26Artboard 2Artboard 20Artboard 35Artboard 15Artboard 14Artboard 50Artboard 26Artboard 14Artboard 40Artboard 21Artboard 10Artboard 37Artboard 46Artboard 33Artboard 8

On the Efficient Determination of Most Near Neighbors (Cód: 9574033)

Mark S. Manasse

Morgan and Claypool Publishers (Livros Digitais)

Ooops! Este produto não está mais a venda.
Mas não se preocupe, temos uma versão atualizada para você.

Ooopss! Este produto está fora de linha, mas temos outras opções para você.
Veja nossas sugestões abaixo!

R$ 84,00

em até 2x de R$ 42,00 sem juros


Em até 1x sem juros de

Cartão Saraiva:


Em até 2x sem juros de

On the Efficient Determination of Most Near Neighbors



The time-worn aphorism 'close only counts in horseshoes and hand grenades' is clearly inadequate. Close also counts in golf, shuffleboard, archery, darts, curling, and other games of accuracy in which hitting the precise center of the target isn't to be expected every time, or in which we can expect to be driven from the target by skilled opponents.This book is not devoted to sports discussions, but to efficient algorithms for determining pairs of closely related web pages-and a few other situations in which we have found that inexact matching is good enough - where proximity suffices. We will not, however, attempt to be comprehensive in the investigation of probabilistic algorithms, approximation algorithms, or even techniques for organizing the discovery of nearest neighbors. We are more concerned with finding nearby neighbors; if they are not particularly close by, we are not particularly interested.In thinking of when approximation is sufficient, remember the oft-told joke about two campers sitting around after dinner. They hear noises coming towards them. One of them reaches for a pair of running shoes, and starts to don them. The second then notes that even with running shoes, they cannot hope to outrun a bear, to which the first notes that most likely the bear will be satiated after catching the slower of them. We seek problems in which we don't need to be faster than the bear, just faster than the others fleeing the bear.


Peso 0.00 Kg
Produto sob encomenda Sim
Marca Morgan and Claypool Publishers (Livros Digitais)
Número de Páginas 100 (aproximado)
Idioma 337
Acabamento e-book
Territorialidade Internacional
Formato Livro Digital Pdf
Gratuito Não
Proteção Drm Sim
Tamanho do Arquivo 864
Início da Venda 01/09/2015
Código do Formato Pdf
Cód. Barras 9781627058094
Ano da Publicação 115
AutorMark S. Manasse