Sciweavers

8636 search results - page 252 / 1728
» How Developers Copy
Sort
View
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 8 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
DIM
2005
ACM
15 years 8 months ago
Pseudonym management using mediated identity-based cryptography
Mobile Location-Based Services (LBS) have raised privacy concerns amongst mobile phone users who may need to supply their identity and location information to untrustworthy third ...
Thibault Candebat, Cameron Ross Dunne, David T. Gr...
PODC
2010
ACM
15 years 8 months ago
On the computational power of oblivious robots: forming a series of geometric patterns
We study the computational power of a distributed system consisting of simple autonomous robots moving on the plane. The robots are endowed with visual perception but do not have ...
Shantanu Das, Paola Flocchini, Nicola Santoro, Mas...
WICON
2008
15 years 8 months ago
Security vulnerabilities in IEEE 802.22
Cognitive Radio (CR) is seen as one of the enabling technologies for realizing a new spectrum access paradigm, viz. Opportunistic Spectrum Sharing (OSS). IEEE 802.22 is the world&...
Kaigui Bian, Jung Min Park
AAAI
2006
15 years 8 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer