274 search results - page 38 / 55 » Computational complexity of queries based on itemsets |
113
Voted
ICDE
2007
IEEE
15 years 6 months ago
2007
IEEE
We consider the problem of semantic load shedding for continuous queries containing window joins on multiple data streams and propose a robust approach that is effective with the ...
113
Voted
VLDB
1999
ACM
15 years 4 months ago
1999
ACM
On-Line Analytical Processing (OLAP) based on a dimensional view of data is being used increasingly for the purpose of analyzing very large amounts of data. To improve query perfo...
113
click to vote
TCSV
2008
15 years 10 days ago
2008
We present a compressed domain scheme that is able to recognize and localize actions in real-time1 . The recognition problem is posed as performing an action video query on a test ...
106
Voted
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
125
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...