297 search results - page 19 / 60 » Polynomial heuristics for query optimization |
DAWAK
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
VLDB
1999
ACM
14 years 5 hour ago
1999
ACM
Data intensive applications today usually run in either a clientserver or a middleware environment. In either case, they must efficiently handle both database queries, which proc...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Classifiers are often used to detect miscreant activities. We study how an adversary can efficiently query a classifier to elicit information that allows the adversary to evade de...
QOSIP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...