301 search results - page 3 / 61 » Efficient Sketches for the Set Query Problem |
CIVR
2010
Springer
14 years 8 months ago
2010
Springer
We propose a set of sketch-based interaction techniques for efficient retrieval of multimedia related to locations. The user makes a simple sketch on a map to interact with it, in...
118
Voted
ACST
2006
15 years 6 days ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
MST
2010
14 years 5 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
SIGMOD
2003
ACM
15 years 11 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
108
click to vote
ADBIS
2004
Springer
15 years 4 months ago
2004
Springer
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar part...