Sciweavers

7758 search results - page 304 / 1552
» On the Number of Distributive Lattices
Sort
View
INFOCOM
2007
IEEE
16 years 29 days ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad-hoc Networks
Abstract— This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets succes...
Atef Abdrabou, Weihua Zhuang
SPAA
2004
ACM
16 years 2 days ago
Effectively sharing a cache among threads
We compare the number of cache misses M1 for running a computation on a single processor with cache size C1 to the total number of misses Mp for the same computation when using p ...
Guy E. Blelloch, Phillip B. Gibbons
DASFAA
2008
IEEE
114views Database» more  DASFAA 2008»
16 years 1 months ago
A P2P Meta-index for Spatio-temporal Moving Object Databases
In this paper we propose a distributed meta-index using a peer-to-peer protocol to allow spatio-temporal queries of moving objects on a large set of distributed database servers. W...
Cecilia Hernández, M. Andrea Rodrígu...
143
Voted
TSD
2004
Springer
16 years 2 hour 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
EOR
2010
84views more  EOR 2010»
15 years 6 months ago
The selection efficiency of tournaments
We discuss tournaments in terms of their efficiency as probabilistic mechanisms that select high-quality alternatives ("players") in a noisy environment. We use two crit...
Dmitry Ryvkin