Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Gísli R. Hjaltason"'
Publikováno v:
SIAM Journal on Computing. 35:22-58
The size of five trie-based methods of sorting large collections of line segments in a spatial database is investigated analytically using a random lines image model and geometric probability techniques. The methods are based on sorting the line segm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::72a65017ae8b4334d523e612427345da
https://doi.org/10.1137/s0097539700368527
https://doi.org/10.1137/s0097539700368527
Autor:
Hanan Samet, Gísli R. Hjaltason
Publikováno v:
ACM Transactions on Database Systems. 28:517-580
Similarity search is a very important operation in multimedia databases and other database applications involving complex objects, and involves finding objects in a data set S similar to a query object q , based on some similarity measure. In this ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c99d92a61dbc61683187e29fbea9acab
https://doi.org/10.1145/958942.958948
https://doi.org/10.1145/958942.958948
Autor:
Hanan Samet, Gísli R. Hjaltason
Publikováno v:
Pattern Recognition Letters. 24:2785-2795
The sa-tree is an interesting metric space indexing structure that is inspired by the Voronoi diagram. In essence, the sa-tree records a portion of the Delaunay graph of the data set, a graph whose vertices are the Voronoi cells, with edges between a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90ef76c9ae8318374e8bfc05b72a89d1
https://doi.org/10.1016/s0167-8655(03)00122-3
https://doi.org/10.1016/s0167-8655(03)00122-3
Autor:
Hanan Samet, Gísli R. Hjaltason
Publikováno v:
IEEE Transactions on Pattern Analysis and Machine Intelligence. 25:530-549
Complex data types-such as images, documents, DNA sequences, etc.-are becoming increasingly important in modern database applications. A typical query in many of these applications seeks to find objects that are similar to some target object, where (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97cbff13df84950db4b8a9e128d1111d
https://doi.org/10.1109/tpami.2003.1195989
https://doi.org/10.1109/tpami.2003.1195989
Autor:
Egemen Tanin, Hanan Samet, Gísli R. Hjaltason, Houman Alborzi, Claudio Esperança, Frantisek Brabec, Frank Morgan
Publikováno v:
Communications of the ACM. 46:61-64
Numerous federal agencies produce official statistics made accessible to ordinary citizens for searching and data retrieval. This is frequently done via the Internet through a Web browser interface. If this data is presented in textual format, it can
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2df0975344153f1af3e58916a9e30efa
https://doi.org/10.1145/602421.602453
https://doi.org/10.1145/602421.602453
Autor:
Gísli R. Hjaltason, Hanan Samet
Publikováno v:
The VLDB Journal The International Journal on Very Large Data Bases. 11:109-137
Spatial indexes, such as those based on the quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involve spatial joins. In this paper we present a number of techniq
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::094f1ac285a7fdfd9f6dac8acf7f1415
https://doi.org/10.1007/s00778-002-0067-8
https://doi.org/10.1007/s00778-002-0067-8
Autor:
Hanan Samet, Gísli R. Hjaltason
Publikováno v:
ACM Transactions on Database Systems. 24:265-318
We compare two different techniques for browsing through a collection of spatial objects stored in an R-tree spatial data structure on the basis of their distances from an arbitrary spatial query object. The conventional approach is one that makes us
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91033a29ecfd87400d722db5e24a6ab0
https://doi.org/10.1145/320248.320255
https://doi.org/10.1145/320248.320255
Autor:
Hanan Samet, Gísli R. Hjaltason
Publikováno v:
SIGMOD Conference
Two new spatial join operations, distance join and distance semi-join , are introduced where the join output is ordered by the distance between the spatial attribute values of the joined tuples. Incremental algorithms are presented for computing thes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7cbc01350b3733ae8ad7cf8f2829a0e7
https://doi.org/10.1145/276305.276326
https://doi.org/10.1145/276305.276326
Publikováno v:
ICPR
A method has been developed for overcoming some of the major obstacles of object recognition. It represents both 2D images and 3D models from a database by viewpoint invariant descriptors in the same invariant space. As there is a large number of pos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3486184419fb73b487f5207184841b1f
https://doi.org/10.1109/icpr.1998.711951
https://doi.org/10.1109/icpr.1998.711951