News Help Institutional access

Search academic resources

Explore institutional catalogs, electronic resources, open-access journals, available collections, and academic access links.

Advanced search
What NODOVOX Discovery brings together: Institutional catalogs, electronic resources, open-access journals, available collections, and academic access links.
forensic medicine law journals Open Access full text

Results

3 results found.

Resource types: Print book E-book Article Journal Thesis Chapter
Academic search
Parallelizing algorithms in ada on clementina II : Face recognition system
Text / resource
Text / resource
Parallelizing algorithms in ada on clementina II : Face recognition system
Champredonde, Raúl et al · SEDICI UNLP · 2001
In the Laboratory of Research and Development on Computer Science of the National University of La Plata, a face recognition system has been developed. This article describes a series of testings based on parallel proces...
Idioma English
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Ver opciones de acceso Bibliographic record
On bulk-synchronous distributed-memory parallel processing of relational-database transactions
Text / resource
Text / resource
On bulk-synchronous distributed-memory parallel processing of relational-database transactions
Marín, Mauricio et al · SEDICI UNLP · 2001
This paper describes two parallel algorithms for the eÆcient processing of relational database transactions and presents a performance analysis of them. These algorithms are built upon the bulk-synchronous parallel mode...
Idioma English
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Ver opciones de acceso Bibliographic record
Evolutionary approaches for the parallel task scheduling problem : the representation issue
Text / resource
Text / resource
Evolutionary approaches for the parallel task scheduling problem : the representation issue
Esquivel, Susana Cecilia et al · SEDICI UNLP · 2001
The problem of how to find a schedule on m > 2 processors of equal capacity that minimises the whole processing time of independent tasks has been shown as belonging to the NP-complete class (Horowitz and Sahni [12]). Ev...
Idioma English
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Ver opciones de acceso Bibliographic record
NODITO
Asistencia de búsqueda académica
Te ayudo a buscar, encontrar y acceder a recursos académicos.
Consultar con NODITO
¿Qué necesitás hacer?
Consultas rápidas
NODITO Asistencia contextual NDX