Buscar

Mostrando ítems 1-10 de 15

An optimal procedure for solving the hierarchical network design problem

Obreque, Carlos; Marianov, Vladimir (TAYLOR & FRANCIS INC, 2007)

The hierarchical network design problem consists of finding a minimum cost bilevel network that connects all the nodes in a set, created by a loopless main path and a forest. The main path is formed by primary (higher cost) ...

The image foresting transform: Theory, algorithms, and applications

Falcao, AX; Stolfi, J; Lotufo, RDA (Ieee Computer SocLos AlamitosEUA, 2004)

Zona de empate : o elo entre transformadas de watershed e conexidade nebulosaTie-zone : the bridge between watershed transforms and fuzzy connectedness

Audigier, Romaric Matthias Michel ([s.n.], 2007)

A Comparison Between K-optimum Path Forest And K-nearest Neighbors Supervised Classifiers

Souza R.; Rittner L.; Lotufo R. (, 2014)

Ranqueamento de informações por Floresta de Caminhos Ótimos

Papa, João Paulo [UNESP]; Universidade Estadual Paulista (Unesp) (Universidade Estadual Paulista (Unesp), 2020-02-20)

A tarefa de aprender a ranquear tem sido amplamente estudada pela comunidade cientíﬁca de aprendizado de máquina principalmente devido a sua utilização na área de recuperação de informações, mineração de dados e processamento ...

Multiscale skeletons by image foresting transform and its application to neuromorphometry

Falcao, AX; Costa, LD; da Cunha, BS (Pergamon-elsevier Science LtdOxfordInglaterra, 2002)

Técnicas de geração de colunas e decomposição de Dantzig-Wolfe aplicadas ao problema de planejamento florestalColumn generation and Dantzig-Wolfe decomposition applied to forest planning problem

Gâmbaro, André, 1980- ([s.n.], 2015)

Buscar

An optimal procedure for solving the hierarchical network design problem

The image foresting transform: Theory, algorithms, and applications

Zona de empate : o elo entre transformadas de watershed e conexidade nebulosaTie-zone : the bridge between watershed transforms and fuzzy connectedness

A Comparison Between K-optimum Path Forest And K-nearest Neighbors Supervised Classifiers

Ranqueamento de informações por Floresta de Caminhos Ótimos

Multiscale skeletons by image foresting transform and its application to neuromorphometry

Técnicas de geração de colunas e decomposição de Dantzig-Wolfe aplicadas ao problema de planejamento florestalColumn generation and Dantzig-Wolfe decomposition applied to forest planning problem

Analysis Of The Watershed Algorithms Based On The Breadth-first And Depth-first Exploring Methods

Elucidating The Relations Among Seeded Image Segmentation Methods And Their Possible Extensions

Foraging ants trade off further for faster: use of natural bridges and trunk trail permanency in carpenter ants

Buscar

Filtros

An optimal procedure for solving the hierarchical network design problem

The image foresting transform: Theory, algorithms, and applications

Zona de empate : o elo entre transformadas de watershed e conexidade nebulosaTie-zone : the bridge between watershed transforms and fuzzy connectedness

A Comparison Between K-optimum Path Forest And K-nearest Neighbors Supervised Classifiers

Ranqueamento de informações por Floresta de Caminhos Ótimos

Multiscale skeletons by image foresting transform and its application to neuromorphometry

Técnicas de geração de colunas e decomposição de Dantzig-Wolfe aplicadas ao problema de planejamento florestalColumn generation and Dantzig-Wolfe decomposition applied to forest planning problem

Analysis Of The Watershed Algorithms Based On The Breadth-first And Depth-first Exploring Methods

Elucidating The Relations Among Seeded Image Segmentation Methods And Their Possible Extensions

Foraging ants trade off further for faster: use of natural bridges and trunk trail permanency in carpenter ants