Sciweavers

1484 search results - page 221 / 297
» Ants meeting algorithms
Sort
View
COLT
2007
Springer
15 years 4 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
CTRSA
2007
Springer
111views Cryptology» more  CTRSA 2007»
15 years 4 months ago
A Practical and Tightly Secure Signature Scheme Without Hash Function
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the...
Benoît Chevallier-Mames, Marc Joye
DCOSS
2007
Springer
15 years 4 months ago
Dwarf: Delay-aWAre Robust Forwarding for Energy-Constrained Wireless Sensor Networks
With the field of wireless sensor networks rapidly maturing, the focus shifts from “easy” deployments, like remote monitoring, to more difficult domains where applications imp...
Mario Strasser, Andreas Meier, Koen Langendoen, Ph...
UIC
2007
Springer
15 years 4 months ago
A Lightweight Scheme for Node Scheduling in Wireless Sensor Networks
Abstract. The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the l...
Ming Liu, Yuan Zheng, Jiannong Cao, Wei Lou, Guiha...
AICT
2006
IEEE
104views Communications» more  AICT 2006»
15 years 4 months ago
X-domain QoS budget negotiation using Dynamic Programming
Quality of Service (QoS) has been a major concern in the field of network management, even more so for emerging dynamic multimedia applications (Video on Demand, Telefony over IP...
Hélia Pouyllau, Armen Aghasaryan, Laurent C...