301 search results - page 20 / 61 » Efficient Sketches for the Set Query Problem |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
108
click to vote
SIGMOD
2010
ACM
14 years 11 months ago
2010
ACM
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
PODS
2008
ACM
15 years 11 months ago
2008
ACM
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
101
click to vote
PRIS
2008
15 years 12 days ago
2008
Abstract. This paper addresses the problem of feature selection within classification processes. We present a comparison of a feature subset selection with respect to two boosting ...