1007 search results - page 142 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
125
click to vote
SIGMOD
2003
ACM
16 years 2 months ago
2003
ACM
We propose a framework for integrating data from multiple relational sources into an XML document that both conforms to a given DTD and satisfies predefined XML constraints. The f...
138
Voted
ICIP
2009
IEEE
15 years 6 days ago
2009
IEEE
In this paper, we discuss the design of a highly-parallel motion estimator for real-time Scalable Video Coding (SVC). In an SVC, motion is commonly estimated bidirectionally and o...
133
Voted
CINQ
2004
Springer
15 years 8 months ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
153
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In particle filtering, resampling is the only step that cannot be fully parallelized. Recently, we have proposed algorithms for distributed resampling implemented on architecture...
151
Voted
ICDE
2002
IEEE
15 years 7 months ago
2002
IEEE
Soon, much of the data exchanged over the Internet will be encoded in XML, allowing for sophisticated filtering and content-based routing. We have built a filtering engine called ...