NODOVOX | Discovery

Towards a polynomial equivalence between {k}-packing functions and k-limited packings in graphs

Artículo

Material complementario disponible Artículo CONICET Digital

Towards a polynomial equivalence between {k}-packing functions and k-limited packings in graphs

Leoni, Valeria Alejandra et al · Springer · 2016 · ISSN 0302-9743

Given a positive integer k, the {k}-packing function problem ({k}PF) is to find in a given graph G, a function f of maximum weight that assigns a non-negative integer to the vertices of G in such a way that the sum of f(...

Idioma eng

Material complementario disponibleEl enlace apunta a material asociado, anexos, tablas, datos o página complementaria. No se marca como libro/texto completo.

Material complementario

Abrir material Ficha bibliográfica

Processing Time Reduction: an Application in Living Human High-Resolution Diffusion Magnetic Resonance Imaging Data

Artículo

Material complementario disponible Artículo CONICET Digital

Processing Time Reduction: an Application in Living Human High-Resolution Diffusion Magnetic Resonance Imaging Data

Lori, Nicolás Francisco et al · Springer · 2016 · ISSN 0148-5598

High Angular Resolution Diffusion Imaging (HARDI) is a type of brain imaging that collects a very large amount of data, and if many subjects are considered then it amounts to a big data framework (e.g., the human connect...

Idioma eng

Material complementario disponibleEl enlace apunta a material asociado, anexos, tablas, datos o página complementaria. No se marca como libro/texto completo.

Material complementario

Abrir material Ficha bibliográfica

Buscar recursos académicos

Resultados