Sciweavers

3600 search results - page 549 / 720
» The settling-time reducibility ordering
Sort
View
SIGMETRICS
2002
ACM
114views Hardware» more  SIGMETRICS 2002»
15 years 6 months ago
Search and replication in unstructured peer-to-peer networks
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenke...
TCSV
2002
124views more  TCSV 2002»
15 years 6 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
TIP
2002
109views more  TIP 2002»
15 years 6 months ago
Adaptive rood pattern search for fast block-matching motion estimation
In this paper, we propose a novel and simple fast block-matching algorithm (BMA), called adaptive rood pattern search (ARPS), which consists of two sequential search stages: 1) ini...
Yao Nie, Kai-Kuang Ma
TON
2002
170views more  TON 2002»
15 years 6 months ago
The BLUE active queue management algorithms
In order to stem the increasing packet loss rates caused by an exponential increase in network traffic, the IETF has been considering the deployment of active queue management tech...
Wu-chang Feng, Kang G. Shin, Dilip D. Kandlur, Deb...
TON
2002
175views more  TON 2002»
15 years 6 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher