Sciweavers

16666 search results - page 2606 / 3334
» Descriptive and Computational Complexity
Sort
View
SIGECOM
2008
ACM
122views ECommerce» more  SIGECOM 2008»
15 years 7 months ago
On the windfall of friendship: inoculation strategies on social networks
This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit i...
Dominic Meier, Yvonne Anne Oswald, Stefan Schmid, ...
SAC
2006
ACM
15 years 7 months ago
Assisted verification of elementary functions using Gappa
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
Florent de Dinechin, Christoph Quirin Lauter, Guil...
SOCA
2008
IEEE
15 years 7 months ago
Log-based mining techniques applied to Web service composition reengineering
There is no doubt that SOA and BPM will continue to evolve dependently for the next ten years. Preparing common research infrastructures will require most important efforts of web ...
Walid Gaaloul, Karim Baïna, Claude Godart
INFORMATICALT
2007
76views more  INFORMATICALT 2007»
15 years 7 months ago
An Integrative Framework to Protocol Analysis and Repair: Bellare-Rogaway Model + Planning + Model Checker
A modified version of the Bellare and Rogaway (1993) adversarial model is encoded using Asynchronous Product Automata (APA). A model checker tool, Simple Homomorphism Verificatio...
Kim-Kwang Raymond Choo
IPL
2007
111views more  IPL 2007»
15 years 7 months ago
Powering requires threshold depth 3
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
Alexander A. Sherstov
« Prev « First page 2606 / 3334 Last » Next »