Sciweavers

620 search results - page 38 / 124
» Optimizing the BSD routing system for parallel processing
Sort
View
ATAL
2007
Springer
14 years 3 months ago
Multi-task overlapping coalition parallel formation algorithm
The issue of coalition formation has been investigated from many aspects, but until recently little attention has been paid to overlapping coalition formation. What’s more, an a...
Chao-Feng Lin, Shan-Li Hu
VLDB
2004
ACM
100views Database» more  VLDB 2004»
14 years 2 months ago
Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molin...
SIGMOD
2010
ACM
227views Database» more  SIGMOD 2010»
14 years 1 months ago
SecureBlox: customizable secure distributed data processing
We present SecureBlox, a declarative system that unifies a distributed query processor with a security policy framework. SecureBlox decouples security concerns from system speci...
William R. Marczak, Shan Shan Huang, Martin Braven...
ICIP
1995
IEEE
14 years 10 months ago
Parallel programmable video co-processor design
Modern video applications call for computationally intensive data processing at very high data rate. In order to meet the high-performance/low-cost constraints, the stateof-the-ar...
An-Yeu Wu, K. J. Ray Liu, Arun Raghupathy, Shang-C...
CLOUD
2010
ACM
14 years 1 months ago
Comet: batched stream processing for data intensive distributed computing
Batched stream processing is a new distributed data processing paradigm that models recurring batch computations on incrementally bulk-appended data streams. The model is inspired...
Bingsheng He, Mao Yang, Zhenyu Guo, Rishan Chen, B...