3874 search results - page 300 / 775 » Approximation Algorithms for k-hurdle Problems |
194
click to vote
WEA
2010
Springer
15 years 11 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...
153
click to vote
ICDT
2005
ACM
15 years 10 months ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
286
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
253
click to vote
SIGMOD
2005
ACM
16 years 5 months ago
2005
ACM
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
149
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...