1007 search results - page 63 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
144
click to vote
EDBT
2011
ACM
14 years 7 months ago
2011
ACM
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
119
click to vote
ICPADS
1998
IEEE
15 years 8 months ago
1998
IEEE
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...
142
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p strea...
259
click to vote
ICDE
1999
IEEE
16 years 5 months ago
1999
IEEE
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, heterogeneous, and distributed collection of information sources. However, the inc...
123
click to vote
TMI
2002
15 years 3 months ago
2002
Active model-based segmentation has frequently been used in medical image processing with considerable success. Although the active model-based method was initially viewed as an op...