Sciweavers

892 search results - page 172 / 179
» et 2007
Sort
View
COCO
2007
Springer
91views Algorithms» more  COCO 2007»
14 years 2 months ago
Lower Bounds for Multi-Player Pointer Jumping
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
Amit Chakrabarti
COCO
2007
Springer
108views Algorithms» more  COCO 2007»
14 years 2 months ago
The Communication Complexity of Correlation
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
Prahladh Harsha, Rahul Jain, David A. McAllester, ...
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
14 years 2 months ago
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
EUROSSC
2007
Springer
14 years 2 months ago
Sensing Motion Using Spectral and Spatial Analysis of WLAN RSSI
In this paper we present how motion sensing can be obtained just by observing the WLAN radio signal strength and its fluctuations. The temporal, spectral and spatial characteristi...
Kavitha Muthukrishnan, Maria Eva Lijding, Nirvana ...
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
14 years 2 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee