777 search results - page 123 / 156 » A fast algorithm for the computation of an upper bound on th... |
PODS
2003
ACM
14 years 8 months ago
2003
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
ICCAD
2003
IEEE
14 years 5 months ago
2003
IEEE
The application of general clock skew scheduling is practically limited due to the difficulties in implementing a wide spectrum of dedicated clock delays in a reliable manner. Th...
WCNC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract—We tackle the problem of providing minimum datarate guarantees for different classes-of-service in an OFDMAbased network, while obtaining a high system throughput. Our a...
ISPA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. In mobile ad hoc networks (MANETs), networks can be partitioned into clusters. Clustering algorithms are localized algorithms that have the property of creating an upper ...
CIKM
2006
Springer
14 years 11 days ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...