Browsing by Author "Chávez, Edgar"

Now showing items 1-7 of 7

    • A compact space decomposition for effective metric indexing 
      Chávez, Edgar; Navarro, Gonzalo (ELSEVIER SCIENCE BV, 2005-07-01)
      he metric space model abstracts many proximity search problems, from nearest-neighbor classifiers to textual and multimedia information retrieval. In this context, an index is a data structure that speeds up proximity ...
    • Effective proximity retrieval by ordering permutations 
      Chávez, Edgar; Figueroa, Karina; Navarro, Gonzalo (IEEE COMPUTER SOC, 2008-09)
      We introduce a new probabilistic proximity search algorithm for range and K-nearest neighbor (K-NN) searching in both coordinate and metric spaces. Although there exist solutions for these problems, they boil down to a ...
    • A Metric Index for Approximate String Matching 
      Navarro, Gonzalo; Chávez, Edgar (Elsevier, 2006)
      We present a radically new indexing approach for approximate string matching. The scheme uses the metric properties of the edit distance and can be applied to any other metric between strings. We build a metric space ...
    • A metric index for approximate string matching 
      Chávez, Edgar; Navarro, Gonzalo (ELSEVIER, 2006-03-07)
      We present a radically new indexing approach for approximate string matching. The scheme uses the metric properties of the edit distance and can be applied to any other metric between strings. We build a metric space where ...
    • On the least cost for proximity searching in metric spaces 
      Figueroa, Karina; Chávez, Edgar; Navarro, Gonzalo; Paredes, Rodrigo (SPRINGER-VERLAG BERLIN, 2006)
      Proximity searching consists in retrieving from a database those elements that are similar to a query. As the distance is usually expensive to compute, the goal is to use as few distance computations as possible to satisfy ...
    • Practical construction of k-nearest neighbor graphs in metric spaces 
      Paredes, Rodrigo; Chávez, Edgar; Figueroa, Karina; Navarro, Gonzalo (SPRINGER-VERLAG BERLIN, 2006)
      Let U be a set of elements and d a distance function defined among them. Let NNk (u) be the k elements in U - {u} having the smallest distance to u. The k-nearest neighbor graph (kNNG) is a weighted directed graph G(U,E) ...
    • Synthesis and characterization of BaTiO3 nanoparticles in oxygen atmosphere 
      Fuentes, S.; Zárate Aliaga, Ramón; Chávez, Edgar; Muñoz, P.; Ayala, M.; Espinoza González, Raúl; Leyton, Patricio (ELSEVIER, 2010-09-03)
      A new synthesis route to obtain high-purity barium titanate, BaTiO3, using the sol–gel-hydrothermal reaction of TiCl4 and a BaCl2 solution in an oxygen atmosphere has been developed. The synthesized BaTiO3 nanoparticles ...