Sciweavers

478 search results - page 86 / 96
» Context-Sensitive Dependency Pairs
Sort
View
INFOCOM
2005
IEEE
15 years 11 months ago
Topology aware overlay networks
— Recently, overlay networks have emerged as a means to enhance end-to-end application performance and availability. Overlay networks attempt to leverage the inherent redundancy ...
Junghee Han, David Watson, Farnam Jahanian
INFOCOM
2005
IEEE
15 years 11 months ago
Mobile-assisted localization in wireless sensor networks
Abstract— The localization problem is to determine an assignment of coordinates to nodes in a wireless ad-hoc or sensor network that is consistent with measured pairwise node dis...
Nissanka B. Priyantha, Hari Balakrishnan, Erik D. ...
ATAL
2005
Springer
15 years 11 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
15 years 11 months ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...
GD
2005
Springer
15 years 11 months ago
Odd Crossing Number Is Not Crossing Number
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...