Buscar
Mostrando ítems 1-10 de 88
O problema do menor caminho em grafos eulerianos.
(Universidade Federal do TocantinsAraguaínaCURSO::ARAGUAÍNA::PRESENCIAL::LICENCIATURA::MATEMÁTICAAraguaínaGraduação, 2023)
Daily mobility patterns and costs 2019 in Ciudad Juárez, ChihuahuaPatrones y costos de movilidad cotidiana 2019 en Ciudad Juárez, ChihuahuaPadrões de mobilidade diária e custos 2019 em Ciudad Juárez, Chihuahua
(Facultad de Filosofía y Letras, Universidad de Buenos Aires, 2022)
A graph-based approach for transcribing ancient documents
(Springer Verlag, 2012)
Over the last years, the interest in preserving digitally ancient documents has increased resulting in databases with a huge amount of image data. Most of these documents are not transcribed and thus querying operations ...
2D Euclidean distance transform algorithms: a comparative survey
(Association Computing MachineryNew York, 2008-02)
The distance transform (DT) is a general operator forming the basis of many methods in computer vision and geometry, with great potential for practical applications. However, all the optimal algorithms for the computation ...
Improving OSPF Protocol based Latency : A new algorithm based on Dijkstra by using OSPF existing Metrics in SDN networks
(Universidade Federal de Santa Maria, 2015)
Interactive volume segmentation with differential image foresting transforms
(Ieee-inst Electrical Electronics Engineers IncPiscatawayEUA, 2004)
Construindo o primeiro algoritmo aprovado no Exame da OAB
(2018-08)
No Brasil, é necessário ser aprovado no Exame Unificado da OAB para exercer a advocacia. Isso torna atraente um modelo de educação jurídica orientado a maximizar a aprovação na prova. O presente trabalho questiona se seria ...