Sciweavers

202 search results - page 19 / 41
» A New Measure for the Bandwidth Minimization Problem
Sort
View
SIGMOD
2005
ACM
178views Database» more  SIGMOD 2005»
14 years 7 months ago
Towards Effective Indexing for Very Large Video Sequence Database
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity sear...
Heng Tao Shen, Beng Chin Ooi, Xiaofang Zhou
ICT
2004
Springer
120views Communications» more  ICT 2004»
14 years 24 days ago
Scalable End-to-End Multicast Tree Fault Isolation
We present a novel protocol, M3L, for multicast tree fault isolation based purely upon end-to-end information. Here, a fault is a link with a loss rate exceeding a specified thres...
Timur Friedman, Donald F. Towsley, James F. Kurose
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
13 years 8 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
IWMM
2009
Springer
130views Hardware» more  IWMM 2009»
14 years 2 months ago
A component model of spatial locality
Good spatial locality alleviates both the latency and bandwidth problem of memory by boosting the effect of prefetching and improving the utilization of cache. However, convention...
Xiaoming Gu, Ian Christopher, Tongxin Bai, Chengli...
AINA
2007
IEEE
14 years 1 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein