The digital edition of all books may be viewed on our website before purchase. Excerpt from Optimal Best-Match Retrieval
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books.
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works. This text has been digitally restored from a historical edition. Some errors may persist, however we consider it worth publishing due to the work's historical value.The digital edition of all books may be viewed on our website before purchase.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
EUR 1,07 expédition depuis Etats-Unis vers France
Destinations, frais et délaisVendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LX-9781334254406
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LX-9781334254406
Quantité disponible : 15 disponible(s)
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : New. Print on Demand. This book provides a new scheme to answer best-match queries from a database containing a collection of objects. Best-match queries consist of identifying the closest (according to some similarity measure) objects to a given target. The author's technique generalises earlier approaches and allows for any kind of topology in data structures, which means permitting an arbitrary set of object pairs in the database with absent distances. A Floyd-Warshall style algorithm is used to achieve the optimal approximation of those unknown distances. The proposed heuristic for choosing objects to compare against the target outperforms those suggested in previous work. Artificial data and actual protein sequences are used to illustrate the scheme, demonstrating some weaknesses and advantages of the technique, and showing the superior performance of the author's scheme over others when given the same data structure. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. N° de réf. du vendeur 9781334254406_0
Quantité disponible : Plus de 20 disponibles
Vendeur : moluna, Greven, Allemagne
Etat : New. KlappentextrnrnExcerpt from Optimal Best-Match RetrievalThe best-match problem (also known as the post office problem or the nearest neighbor problem [11] arises in many applications, such as database management information retrieval [4,. N° de réf. du vendeur 2148126788
Quantité disponible : Plus de 20 disponibles