945 search results - page 24 / 189 » Incremental Branching Programs |
DAGSTUHL
2006
13 years 9 months ago
2006
We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an...
ECCC
2010
13 years 7 months ago
2010
We prove that the pseudorandom generator introduced in [INW94] fools group products of a given finite group. The seed length is O(log n log 1 ), where n the length of the word and...
ICSE
2000
IEEE-ACM
13 years 11 months ago
2000
IEEE-ACM
We demonstrate how XML and related technologies can be used for code mobility at any granularity, thus overcoming the restrictions of existing approaches. By not fixing a particul...
CDES
2006
13 years 9 months ago
2006
Recently, several loop buffer designs have been proposed to reduce instruction fetch energy due to size and location advantage of loop buffer. Nevertheless, on design complexity di...
IPCO
2010
13 years 9 months ago
2010
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...