Sciweavers

2941 search results - page 421 / 589
» Communication Performance Issues for Two Cluster Computers
Sort
View
PODS
2002
ACM
98views Database» more  PODS 2002»
16 years 6 months ago
On Propagation of Deletions and Annotations Through Views
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
Peter Buneman, Sanjeev Khanna, Wang Chiew Tan
GLOBECOM
2006
IEEE
16 years 14 days ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang
JUCS
2007
108views more  JUCS 2007»
15 years 6 months ago
On Pipelining Sequences of Data-Dependent Loops
: Sequences of data-dependent tasks, each one traversing large data sets, exist in many applications (such as video, image and signal processing applications). Those tasks usually ...
Rui Rodrigues, João M. P. Cardoso
P2P
2005
IEEE
112views Communications» more  P2P 2005»
15 years 12 months ago
Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems
Distributed peer-to-peer systems rely on voluntary participation of peers to effectively manage a storage pool. In such systems, data is generally replicated for performance and a...
Ronaldo A. Ferreira, Murali Krishna Ramanathan, An...
IWCMC
2006
ACM
16 years 11 days ago
Low complexity design of space-time convolutional codes with high spectral efficiencies
Space time convolutional codes (STCCs) are an effective way to combine transmit diversity with coding. The computational complexity of designing STCCs generally increases exponent...
Kyungmin Kim, Hamid R. Sadjadpour, Rick S. Blum, Y...