1982 search results - page 224 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
128
click to vote
SIGCOMM
1996
ACM
15 years 7 months ago
1996
ACM
Hierarchical Packet Fair Queueing (H-PFQ)algorithms have the potential to simultaneously support guaranteed realtime service, rate-adaptive best-eort, and controlled linksharing s...
149
click to vote
CLUSTER
2005
IEEE
15 years 9 months ago
2005
IEEE
The amount of data collected and stored in databases is growing considerably for almost all areas of human activity. Processing this amount of data is very expensive, both humanly...
122
Voted
HPDC
1999
IEEE
15 years 7 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
226
Voted
ETVC
2008
15 years 5 months ago
2008
s of the LIX Fall Colloquium 2008: Emerging Trends in Visual Computing Frank Nielsen Ecole Polytechnique, Palaiseau, France Sony CSL, Tokyo, Japan Abstract. We list the abstracts o...
119
click to vote
TOG
2002
15 years 3 months ago
2002
Cutting and pasting to combine different elements into a common structure are widely used operations that have been successfully adapted to many media types. Surface design could ...