Sciweavers

295 search results - page 40 / 59
» A New Node Centroid Algorithm for Bandwidth Minimization
Sort
View
VLDB
1994
ACM
129views Database» more  VLDB 1994»
15 years 2 months ago
Hilbert R-tree: An Improved R-tree using Fractals
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
Ibrahim Kamel, Christos Faloutsos
ISPDC
2006
IEEE
15 years 4 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
ICYCS
2008
IEEE
15 years 4 months ago
FAST CASH: FAir and STable Channel ASsignment on Heterogeneous Wireless Mesh Network
— Nowadays wireless mesh routers are facilitating with more wireless channels than ever because of the advanced wireless communication technologies such as OFDM, SDR and CR(cogni...
Panlong Yang, Guihai Chen
TPDS
2008
87views more  TPDS 2008»
14 years 10 months ago
rStream: Resilient and Optimal Peer-to-Peer Streaming with Rateless Codes
Due to the lack of stability and reliability in peer-to-peer networks, multimedia streaming over peer-to-peer networks represents several fundamental engineering challenges. First...
Chuan Wu, Baochun Li
POPL
2003
ACM
15 years 10 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta