2157 search results - page 21 / 432 » Optimal Fast Hashing |
124
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
152
click to vote
ICCV
2011
IEEE
14 years 2 months ago
2011
IEEE
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
EMNLP
2007
15 years 3 months ago
2007
Trigram language models are compressed using a Golomb coding method inspired by the original Unix spell program. Compression methods trade off space, time and accuracy (loss). The...
SPIRE
2005
Springer
15 years 7 months ago
2005
Springer
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
119
click to vote
AAAI
2012
13 years 4 months ago
2012
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...