Добро пожаловать в клуб

Показать / Спрятать  Домой  Новости Статьи Файлы Форум Web ссылки F.A.Q. Логобург    Показать / Спрятать

Главное меню
ДомойНовостиСтатьиДефектологияПостановка звуковФайлыКнижный мирФорумСловарьРассылкаКаталог ссылокРейтинг пользователейЧаВо(FAQ)КонкурсWeb магазинШкольникамЭлектроникаБыт.техникаКарта сайта

Поздравляем нового Логобуржца Галина2007 со вступлением в клуб!



Hashing, Searching, Sketching   Rina Panigrahy

Hashing, Searching, Sketching

160 страниц. 2010 год.
LAP Lambert Academic Publishing
The Information Age has enabled the search for information in ways never imagined before. The search criteria may be exact where the input query is expected to exactly match the search object, or fuzzy -- for instance image search, news search, and similar document search -- making the search problem much harder. Hashing is a simple and effective method for exact search that uses a random hash function to map items into buckets, often viewed as throwing balls into bins. This book studies algorithms for different kinds of search using hashing and sketching, and some fundamental limits of what can be realized using some of these approaches. For exact search, we will see how variants of balls- and-bins processes can be used to derive space efficient methods for maintaining hash tables. For fuzzy search, we will see a variant of a special type of hashing, called locality-sensitive hashing, that uses linear space and how the underlying ideas can be used in the kd-tree...
- Генерация страницы: 0.05 секунд -