627 search results - page 47 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
183
click to vote
WIDM
2004
ACM
15 years 11 months ago
2004
ACM
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
291
click to vote
ICDE
2005
IEEE
16 years 7 months ago
2005
IEEE
Data warehousing and on-line analytical processing (OLAP) are essential for decision support applications. Common OLAP operations include for example drill down, roll up, pivot an...
251
click to vote
ICDE
2001
IEEE
16 years 7 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
201
click to vote
IJCV
2008
15 years 6 months ago
2008
This paper describes two algorithms for the real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/contr...
151
click to vote
DEXA
2010
Springer
15 years 7 months ago
2010
Springer
Significant research efforts have recently been dedicated to modeling and querying uncertain data. In this paper, we focus on skyline analysis of uncertain data, modeled as uncert...