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

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

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

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

Реклама

КНИЖНЫЙ МИР

ANTIPOLE TREE INDEXING AND GRAPHGREPVF   Diego Reforgiato Recupero

ANTIPOLE TREE INDEXING AND GRAPHGREPVF

156 страниц. 2010 год.
LAP Lambert Academic Publishing
There has been increasing interest in building search/index structures to perform similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. A similarity search problem involves a collection of objects (e.g., documents, images) which are characterized by a collection of relevant features and represented as points in a high-dimensional attribute space. The first part of this book will present a new hierarchical clustering algorithm called Antipole Clustering. The algorithm partitions the set of data objects in clusters such that each one has diameter approximately less than a given value. The algorithm returns a tree structure called Antipole Tree in which the leaves are the final clusters. The second part of this book will present, GraphGrepVF, an application-independent method for querying a database of graphs in order to find all the occurrences of a given subgraph. Many applications in industry,...
 
- Генерация страницы: 0.04 секунд -