Sciweavers

17018 search results - page 185 / 3404
» From the How to the What
Sort
View
WWW
2005
ACM
14 years 3 months ago
How to make web sites talk together: web service solution
Integrating web sites to provide more efficient services is a very promising way in the Internet. For example searching house for rent based on train system or preparing a holiday...
Hoang Pham Huy, Takahiro Kawamura, Tetsuo Hasegawa
SIGMETRICS
2008
ACM
101views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
How to parameterize models with bursty workloads
Although recent advances in theory indicate that burstiness in the service time process can be handled effectively by queueing models (e.g., MAP queueing networks [2]), there is a...
Giuliano Casale, Ningfang Mi, Ludmila Cherkasova, ...
P2P
2007
IEEE
104views Communications» more  P2P 2007»
14 years 3 months ago
How stable are large superpeer networks against attack?
In this paper, we analyze the stability of large scale superpeer networks against attacks. Two different kinds of attacks namely deterministic and degree dependent attack have bee...
Bivas Mitra, Sujoy Ghose, Niloy Ganguly
COMPGEOM
2006
ACM
14 years 3 months ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii
TSD
2004
Springer
14 years 3 months ago
How Dominant Is the Commonest Sense of a Word?
We present a mathematical model of word sense frequency distributions, and use word distributions to set parameters. The model implies that the expected dominance of the commonest ...
Adam Kilgarriff