Sciweavers

4843 search results - page 604 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
131
Voted
SODA
2010
ACM
135views Algorithms» more  SODA 2010»
16 years 2 months ago
Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications
We consider the problem of detecting a vector of symbols that is being transmitted over a fading multiple?input multiple?output (MIMO) channel, where each symbol is an ?th root of...
Anthony Man-Cho So
96
Voted
ICCD
2006
IEEE
95views Hardware» more  ICCD 2006»
16 years 1 months ago
Scale in Chip Interconnect requires Network Technology
— Continued scaling of CMOS has lead to a problem of scale as gates are faster than light travelling across a chip. Scalability used to be the hallmark of CMOS. Half the size, do...
Enno Wein
ICCAD
2003
IEEE
127views Hardware» more  ICCAD 2003»
16 years 1 months ago
Code Placement with Selective Cache Activity Minimization for Embedded Real-time Software Design
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
Junhyung Um, Taewhan Kim
EVOW
2010
Springer
15 years 11 months ago
WiMAX Network Planning Using Adaptive-Population-Size Genetic Algorithm
Abstract. IEEE 802.16, also known as WiMAX, is a new wireless access technology for currently increasing demand of wireless high-speed broadband service. Efficient and effective d...
Ting Hu, Yuanzhu Peter Chen, Wolfgang Banzhaf
WIA
2009
Springer
15 years 11 months ago
Short Regular Expressions from Finite Automata: Empirical Results
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
Hermann Gruber, Markus Holzer, Michael Tautschnig