16596 search results - page 3048 / 3320 » Generalized Assignment Problems |
405
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
205
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic loca...
178
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Dynamic plan migration is concerned with the on-the-fly transition from one continuous query plan to a semantically equivalent yet more efficient plan. Migration is important for ...
149
Voted
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical ...
250
click to vote
PODS
2001
ACM
16 years 6 months ago
2001
ACM
The dimensionality curse has profound e ects on the effectiveness of high-dimensional similarity indexing from the performance perspective. One of the well known techniques for im...