1091 search results - page 86 / 219 » On the temporal dimension of search |
131
Voted
ISM
2008
IEEE
15 years 1 months ago
2008
IEEE
The "Reminiscing View" is a visualization system for browsing hierarchically organized photo and video-clip collections. The current Reminiscing View prototype supports ...
137
Voted
PVLDB
2010
14 years 8 months ago
2010
Web archives are useful resources to find out about the temporal evolution of persons, organizations, products, or other topics. However, even when advanced text search functional...
121
click to vote
AFRICACRYPT
2010
Springer
15 years 8 months ago
2010
Springer
In this paper we present an algorithm for parallel exhaustive search for short vectors in lattices. This algorithm can be applied to a wide range of parallel computing systems. To ...
160
Voted
CEC
2008
IEEE
15 years 8 months ago
2008
IEEE
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
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...