868 search results - page 60 / 174 » A general compression algorithm that supports fast searching |
WWW
2008
ACM
14 years 9 months ago
2008
ACM
This paper presents PrivacyGrid - a framework for supporting anonymous location-based queries in mobile information delivery systems. The PrivacyGrid framework offers three unique...
WWW
2004
ACM
14 years 9 months ago
2004
ACM
Without textual descriptions or label information of images, searching semantic concepts in image databases is still a very challenging task. While automatic annotation techniques...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
SIGIR
2009
ACM
14 years 3 months ago
2009
ACM
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
CP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or duri...