Výsledky vyhledávání - "Reyes, Nora Susana"

List of clustered permutations in secondary memory for proximity searching

Autor: Roggero, Patricia, Reyes, Nora Susana, Figueroa, Karina, Paredes, Rodrigo

Publikováno v: Journal of Computer Science and Technology, Vol 15, Iss 02, Pp 107-113 (2015)
SEDICI (UNLP)
Universidad Nacional de La Plata
instacron:UNLP

Similarity search is a difficult problem and various indexing schemas have been defined to process similarity queries efficiently in many applications, including multimedia databases and other repositories handling complex objects. Metric indices sup

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a2ed52f9e83f76aaf45f6f49c9f82fa2
https://journal.info.unlp.edu.ar/JCST/article/view/546

Zobrazit plný text záznamu

Decomposability of DiSAT for Index Dynamization

Autor: Chávez, Edgar, Di Genaro, María E., Reyes, Nora Susana, Roggero, Patricia

Publikováno v: Journal of Computer Science and Technology, Vol 17, Iss 02, Pp e15-e15 (2017)
SEDICI (UNLP)
Universidad Nacional de La Plata
instacron:UNLP

The Distal Spatial Approximation Tree (DiSAT) is one of the most competitive indexes for exact proximity searching. The absence of parameters, the most salient feature, makes the index a suitable choice for a practitioner. The most serious drawback i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::db5c2dc808c2137108d59d5a6a5fa5d2
http://sedici.unlp.edu.ar/handle/10915/62937

Zobrazit plný text záznamu

An efficient alternative for deletions in dynamic spatial approximation trees

Autor: Kasián, Fernando, Ludueña, Verónica, Reyes, Nora Susana, Roggero, Patricia

Publikováno v: Journal of Computer Science and Technology, Vol 14, Iss 01, Pp 39-45 (2014)
SEDICI (UNLP)
Universidad Nacional de La Plata
instacron:UNLP

Metric space searching is an emerging technique to address the problem of similarity searching in many applications. In order to efficiently answer similarity queries, the database must be indexed. In some interesting real applications dynamism is an

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::378cb2412424fa34412260dac7e85f7f
https://journal.info.unlp.edu.ar/JCST/article/view/580

Zobrazit plný text záznamu

A parallel search algorithm for the SAT

Autor: Gil Costa, Graciela Verónica, Printista, Alicia Marcela, Reyes, Nora Susana, Marin Cahiuan, Juan Mauricio

Publikováno v: Journal of Computer Science and Technology, Vol 5, Iss 04, Pp 299-304 (2005)
SEDICI (UNLP)
Universidad Nacional de La Plata
instacron:UNLP

In order to be able to perform multimedia searches (like sounds, videos, images, etc.) we have to use data structures like the Spatial Approximation Tree (SAT). This structure is a nice example of a tree structure in which well-known tricks for tree

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::26d01df72bbfcb15cc3fa83913b9f092
https://journal.info.unlp.edu.ar/JCST/article/view/851

Zobrazit plný text záznamu

XM-Tree, a new index for web information retrieval

Autor: Deco, Claudia, Pierángeli, Guillermo, Bender, Cristina, Reyes, Nora Susana

Publikováno v: SEDICI (UNLP)
Universidad Nacional de La Plata
instacron:UNLP
Journal of Computer Science and Technology, Vol 8, Iss 02, Pp 78-84 (2008)

Web Information Retrieval is another problem of searching elements of a set that are closest to a given query under a certain similarity criterion. It is of interest to take advantage of metric spaces in order to solve a search in an effective and ef

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e0d5f95f67c3e80ff6b136347a8f2978
http://sedici.unlp.edu.ar/handle/10915/9627

Zobrazit plný text záznamu

Using boolean circuits for the parallel computation of queries

Autor: Gagliardi, Edilma Olinda, Herrera, Norma Edith, Reyes, Nora Susana, Turull Torres, José María

Publikováno v: SEDICI (UNLP)
Universidad Nacional de La Plata
instacron:UNLP
Journal of Computer Science and Technology, Vol 1, Iss 05, Pp 13 p.-13 p. (2001)

We present partial results of a research project in which we use boolean circuits as a parallel computation model for the expression of queries to relational databases. For that purpose, we use the well-known equivalence between First Order Logic (FO

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::db094c78bcf25512b8b4b1dc449c4ded
http://sedici.unlp.edu.ar/handle/10915/9420

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání