Sciweavers

1169 search results - page 192 / 234
» Two Ways to Common Knowledge
Sort
View
84
Voted
PVLDB
2010
112views more  PVLDB 2010»
14 years 8 months ago
Two-way Replacement Selection
The performance of external sorting using merge sort is highly dependent on the length of the runs generated. One of the most commonly used run generation strategies is Replacemen...
Xavier Martinez-Palau, David Dominguez-Sal, Josep-...
TIFS
2011
252views Education» more  TIFS 2011»
14 years 4 months ago
Secure Device Pairing Based on a Visual Channel: Design and Usability Study
— “Pairing” is the establishment of authenticated key agreement between two devices over a wireless channel. Such devices are ad hoc in nature as they lack any common preshar...
Nitesh Saxena, Jan-Erik Ekberg, Kari Kostiainen, N...
91
Voted
IPPS
2009
IEEE
15 years 4 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
15 years 4 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
101
Voted
EUROPAR
2005
Springer
15 years 3 months ago
Hierarchical Scheduling for Moldable Tasks
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
Pierre-François Dutot