Sciweavers

1007 search results - page 133 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
129
Voted
ICPP
2008
IEEE
15 years 9 months ago
Resource Allocation for Distributed Streaming Applications
—We consider resource allocation for distributed streaming applications running in a grid environment, where continuously streaming data needs to be aggregated and processed to p...
Qian Zhu, Gagan Agrawal
126
Voted
PODC
2000
ACM
15 years 6 months ago
Efficient atomic broadcast using deterministic merge
We present an approach for merging message streams from producers distributed over a network, using a deterministic algorithm that is independent of any nondeterminism of the syst...
Marcos Kawazoe Aguilera, Robert E. Strom
111
Voted
TCSV
2002
124views more  TCSV 2002»
15 years 2 months ago
Efficient moving object segmentation algorithm using background registration technique
An efficient moving object segmentation algorithm suitable for real-time content-based multimedia communication systems is proposed in this paper. First, a background registration ...
Shao-Yi Chien, Shyh-Yih Ma, Liang-Gee Chen
CF
2010
ACM
15 years 7 months ago
Variant-based competitive parallel execution of sequential programs
Competitive parallel execution (CPE) is a simple yet attractive technique to improve the performance of sequential programs on multi-core and multi-processor systems. A sequential...
Oliver Trachsel, Thomas R. Gross
140
Voted
IPPS
2007
IEEE
15 years 8 months ago
Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
Hailiang Mei, Pravin Pawar, Ing Widya