651 search results - page 31 / 131 » Index Sets and Universal Numberings |
179
click to vote
SBBD
2008
15 years 3 months ago
2008
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
106
click to vote
DASFAA
2008
IEEE
15 years 8 months ago
2008
IEEE
Applications demanding multidimensional index structures for performing efficient similarity queries often involve a large amount of data. The conventional tuple-loading approach t...
125
click to vote
ADBIS
2009
Springer
15 years 6 months ago
2009
Springer
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
131
click to vote
ACM
1995
15 years 5 months ago
1995
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
108
click to vote
MP
2007
15 years 1 months ago
2007
The question of nonemptiness of the intersection of a nested sequence of closed sets is fundamental in a number of important optimization topics, including the existence of optima...