Sciweavers

254 search results - page 5 / 51
» Counting with Population Protocols
Sort
View
TCOM
2010
91views more  TCOM 2010»
14 years 8 months ago
Slot-wise maximum likelihood estimation of the tag population size in FSA protocols
Abstract—Framed Slotted Aloha (FSA) is a popular anticollision technique in state-of-the-art RF-ID systems, as in ISO/IEC CD 18000-6 for 900MHz or the EPCglobal HF Gen 2 draft fo...
Bastian Knerr, Martin Holzer 0002, Christoph Anger...
77
Voted
ASIACRYPT
1999
Springer
15 years 2 months ago
ECC: Do We Need to Count?
Abstract. A prohibitive barrier faced by elliptic curve users is the difficulty of computing the curves’ cardinalities. Despite recent theoretical breakthroughs, point counting ...
Jean-Sébastien Coron, Helena Handschuh, Dav...
MICRO
2008
IEEE
124views Hardware» more  MICRO 2008»
15 years 4 months ago
Token tenure: PATCHing token counting using directory-based cache coherence
Traditional coherence protocols present a set of difficult tradeoffs: the reliance of snoopy protocols on broadcast and ordered interconnects limits their scalability, while dire...
Arun Raghavan, Colin Blundell, Milo M. K. Martin
85
Voted
IPPS
2006
IEEE
15 years 4 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
CORR
2010
Springer
142views Education» more  CORR 2010»
14 years 10 months ago
The Accuracy of Tree-based Counting in Dynamic Networks
Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn...
Supriya Krishnamurthy, John Ardelius, Erik Aurell,...