Sciweavers

5372 search results - page 214 / 1075
» complexity 2007
Sort
View
IPL
2007
60views more  IPL 2007»
13 years 8 months ago
Robustness of PSPACE-complete sets
We study the robustness of complete languages in PSPACE and prove that they are robust against P-selective sparse sets. Earlier similar results are known for EXPcomplete sets [3] ...
Aduri Pavan, Fengming Wang
OPODIS
2004
13 years 9 months ago
Comparison of Failures and Attacks on Random and Scale-Free Networks
Abstract. It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on the...
Jean-Loup Guillaume, Matthieu Latapy, Cléme...
CORR
2007
Springer
134views Education» more  CORR 2007»
13 years 8 months ago
On Four-group ML Decodable Distributed Space Time Codes for Cooperative Communication
— A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase b...
G. Susinder Rajan, Anshoo Tandon, B. Sundar Rajan
CORR
2007
Springer
131views Education» more  CORR 2007»
13 years 8 months ago
Cognitive Medium Access: Exploration, Exploitation and Competition
—This paper considers the design of efficient strategies that allow cognitive users to choose frequency bands to sense and access among multiple bands with unknown parameters. F...
Lifeng Lai, Hesham El Gamal, Hai Jiang, H. Vincent...
ISCAS
2007
IEEE
119views Hardware» more  ISCAS 2007»
14 years 2 months ago
Hardened by Design Techniques for Implementing Multiple-Bit Upset Tolerant Static Memories
— We present a novel MBU-tolerant design, which utilizes layout-based interleaving and multiple-node disruption tolerant memory latches. This approach protects against grazing in...
Daniel R. Blum, José G. Delgado-Frias