@article{BUMI_2005_8_8A_3-1_621_0, author = {Diego Reforgiato Recupero}, title = {Strutture dati e algoritmi per problemi di ottimizzazione e di ricerca in spazi metrici e grafi}, journal = {Bollettino dell'Unione Matematica Italiana}, volume = {8-A}, year = {2005}, pages = {621-624}, language = {it}, url = {http://dml.mathdoc.fr/item/BUMI_2005_8_8A_3-1_621_0} }
Reforgiato Recupero, Diego. Strutture dati e algoritmi per problemi di ottimizzazione e di ricerca in spazi metrici e grafi. Bollettino dell'Unione Matematica Italiana, Tome 8-A (2005) pp. 621-624. http://gdmltest.u-ga.fr/item/BUMI_2005_8_8A_3-1_621_0/
[1] Antipole Tree Indexing to Support Range Search and K-Nearest-Neighbor Search in Metric Spaces, IEEE Transactions on Knowledge and Data Engineering (TKDE), 17 (2005), 535-550.
, , , e ,[2] Antipole Clustering For Fast Texture Synthesis, Winter School of Computer Graphics (WSCG) (2003).
, e ,[3] ANTICLUSTAL: Multiple Sequence Alignment by Antipole Clustering and Linear Approximate 1- Median Computation, IEEE Computer Society Bioinformatics Conference (CSB) (2003), 326-336.
, , , , , , , , , e ,[4] GraphGrep, a fast and universal method for querying graphs, IEEE International Conference in Pattern Recognition (ICPR) (2002).
e ,[5] Graph matching: a fast algorithm and its evaluation, IEEE International Conference in Pattern Recognition (ICPR) (1998). | Zbl 0909.68154
, , , e ,