Sciweavers

212 search results - page 20 / 43
» On Lengths of Rainbow Cycles
Sort
View
FOCS
2008
IEEE
14 years 4 months ago
A Counterexample to Strong Parallel Repetition
The parallel repetition theorem states that for any two-prover game, with value 1 − (for, say, ≤ 1/2), the value of the game repeated in parallel n times is at most (1 − c)â...
Ran Raz
DATE
2007
IEEE
109views Hardware» more  DATE 2007»
14 years 4 months ago
Area optimization of multi-cycle operators in high-level synthesis
Conventional high-level synthesis algorithms usually employ multi-cycle operators to reduce the cycle length in order to improve the circuit performance. These operators need seve...
María C. Molina, Rafael Ruiz-Sautua, Jose M...
MP
2006
88views more  MP 2006»
13 years 9 months ago
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCorm...
ISCAS
2006
IEEE
100views Hardware» more  ISCAS 2006»
14 years 3 months ago
Dynamic control of spinal locomotion circuits
We show that an ongoing locomotor pattern can that the physiology of the lamprey's spinal system generalizes to be modulated by application of discrete electrical stimuli to l...
R. Jacob Vogelstein, Ralph Etienne-Cummings, Nitis...
IEEESCC
2009
IEEE
13 years 7 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...