Sciweavers

406 search results - page 7 / 82
» Boosting Using Branching Programs
Sort
View
ECCC
2010
83views more  ECCC 2010»
13 years 6 months ago
Deterministic Identity Testing of Read-Once Algebraic Branching Programs
In this paper we study polynomial identity testing of sums of k read-once algebraic branching programs (Σk-RO-ABPs), generalizing the work of Shpilka and Volkovich [1, 2], who co...
Maurice Jansen, Youming Qiao, Jayalal M. N. Sarma
IPCO
2007
108views Optimization» more  IPCO 2007»
13 years 8 months ago
Orbital Branching
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
EXPCS
2007
13 years 11 months ago
Introducing entropies for representing program behavior and branch predictor performance
Predictors are inherent components of state-of-the-art microprocessors. Branch predictors are discussed actively from diverse perspectives. Performance of a branch predictor large...
Takashi Yokota, Kanemitsu Ootsu, Takanobu Baba
DSN
2007
IEEE
13 years 11 months ago
Augmenting Branch Predictor to Secure Program Execution
Although there are various ways to exploit software vulnerabilities for malicious attacks, the attacks always result in unexpected behavior in program execution, deviating from wh...
Yixin Shi, Gyungho Lee
FOCS
2010
IEEE
13 years 5 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin