Sciweavers

1552 search results - page 157 / 311
» On the Complexity of Constant Propagation
Sort
View
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
15 years 11 months ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
EUROCRYPT
2010
Springer
15 years 11 months ago
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tr...
INFOCOM
2010
IEEE
15 years 5 months ago
Routing for Energy Minimization in the Speed Scaling Model
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...
Matthew Andrews, Antonio Fernández, Lisa Zh...
ECCC
2011
223views ECommerce» more  ECCC 2011»
15 years 1 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
BIOCOMP
2006
15 years 8 months ago
Membrane Remodeling and Diffusion of Cytochrome C from a Geometrically Idealized Mitochondrial Crista
In healthy eukaryotic cells, mitochondria have an outer membrane that surrounds a complex inner membrane structure [7,8]. Cytochrome c is found in the space between the two membra...
John Manor, Peter Salamon, James Nulton, Joseph Ma...