Sciweavers

27 search results - page 1 / 6
» All Elephants are Bigger than All Mice
Sort
View
DLOG
2008
13 years 7 months ago
All Elephants are Bigger than All Mice
Abstract. We investigate the concept product as an expressive feature for description logics (DLs). While this construct allows us to express an arguably very common and natural ty...
Sebastian Rudolph, Markus Krötzsch, Pascal Hi...
SIGMETRICS
2002
ACM
162views Hardware» more  SIGMETRICS 2002»
13 years 5 months ago
Internet stream size distributions
We present and discuss stream size and lifetime distributions for web and non-web TCP traffic on a campus OC12 link at UC San Diego. The distributions are stable over long periods...
Nevil Brownlee, Kimberly C. Claffy
APNOMS
2006
Springer
13 years 9 months ago
Temporal Patterns and Properties in Multiple-Flow Interactions
It is widely recognized that today's Internet traffic is mostly carried by a relatively small number of elephant flows while mice flows constitute up to 80% of all active flow...
Marat Zhanikeev, Yoshiaki Tanaka
PVLDB
2010
178views more  PVLDB 2010»
13 years 3 months ago
Hadoop++: Making a Yellow Elephant Run Like a Cheetah (Without It Even Noticing)
MapReduce is a computing paradigm that has gained a lot of attention in recent years from industry and research. Unlike parallel DBMSs, MapReduce allows non-expert users to run co...
Jens Dittrich, Jorge-Arnulfo Quiané-Ruiz, A...
SOFSEM
2007
Springer
13 years 11 months ago
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
Yefim Dinitz, Shay Solomon