Sciweavers

590 search results - page 43 / 118
» Some Aspects of Computable Functional Analysis
Sort
View
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
Amplifying Collision Resistance: A Complexity-Theoretic Treatment
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca T...
EOR
2008
69views more  EOR 2008»
13 years 8 months ago
On the complexity of optimization over the standard simplex
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
E. de Klerk, Dick den Hertog, G. Elabwabi
MABS
2004
Springer
14 years 2 months ago
Agent-Based Modelling of Forces in Crowds
Recent events have highlighted the importance of good models of crowds, however many existing crowd models are either computationally inefficient, or are missing a crucial human be...
Colin Marc Henein, Tony White
WSC
1997
13 years 10 months ago
Conduct, Misconduct, and Cargo Cult Science
I will elaborate some principles of ethical conduct in science that correspond to Richard Feynman’s wellknown precepts of “utter honesty” and “leaning over backwards” in...
James R. Wilson
UC
2009
Springer
14 years 3 months ago
Computing Domains of Attraction for Planar Dynamics
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
Daniel S. Graça, Ning Zhong