Sciweavers

2632 search results - page 143 / 527
» On the degree of MIMO systems
Sort
View
JC
2006
105views more  JC 2006»
15 years 6 months ago
On the complexity of the resolvent representation of some prime differential ideals
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solern&oa...
OPODIS
2010
15 years 4 months ago
Self-stabilizing Byzantine Asynchronous Unison,
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than s...
Swan Dubois, Maria Gradinariu Potop-Butucaru, Mikh...
CC
2010
Springer
112views System Software» more  CC 2010»
15 years 29 days ago
Random Cnf's are Hard for the Polynomial Calculus
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
Eli Ben-Sasson, Russell Impagliazzo
DAC
1997
ACM
15 years 10 months ago
System-Level Synthesis of Low-Power Hard Real-Time Systems
We present a system-level approach for power optimization under a set of user specified costs and timing constraints of hard real-time designs. The approach optimizes all three d...
Darko Kirovski, Miodrag Potkonjak
INFOCOM
2008
IEEE
16 years 26 days ago
BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks
Abstract—In order to improve scalability and reduce maintenance overhead for structured Peer-to-Peer systems, researchers design optimal architectures with constant degree and lo...
Deke Guo, Yunhao Liu, Xiang-Yang Li