Sciweavers

5 search results - page 1 / 1
» Obfuscating straight line arithmetic programs
Sort
View
DRM
2009
Springer
14 years 1 months ago
Obfuscating straight line arithmetic programs
Srivatsan Narayanan, Ananth Raghunathan, Ramarathn...
EUROGP
2009
Springer
149views Optimization» more  EUROGP 2009»
14 years 1 months ago
Adaptation, Performance and Vapnik-Chervonenkis Dimension of Straight Line Programs
Abstract. We discuss here empirical comparation between model selection methods based on Linear Genetic Programming. Two statistical methods are compared: model selection based on ...
José Luis Montaña, César Luis...
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 4 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
FOCS
2007
IEEE
14 years 23 days ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
STACS
1999
Springer
13 years 10 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...