Sciweavers

1368 search results - page 3 / 274
» Avoiding Simplicity Is Complex
Sort
View
PARLE
1987
13 years 9 months ago
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
Modern VLSI technology has changed the economic rules by which the balance between processing power, memory and communications is decided in computing systems. This will have a pr...
Peter H. Welch
ICASSP
2008
IEEE
14 years 7 days ago
Avoiding divergence in the constant modulus algorithm
One of the most popular algorithms for blind equalization is the Constant Modulus Algorithm (CMA), due to its simplicity and low computational cost. However, if the step-size is n...
Maria D. Miranda, M. T. M. Silva, Vitor H. Nascime...
DLT
2009
13 years 3 months ago
On the Complexity of Deciding Avoidability of Sets of Partial Words
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
Brandon Blakeley, Francine Blanchet-Sadri, Josh Gu...
DAC
2004
ACM
14 years 6 months ago
Reliability-driven layout decompaction for electromigration failure avoidance in complex mixed-signal IC designs
The negative effect of electromigration on signal and power line lifetime and functional reliability is an increasingly important problem for the physical design of integrated cir...
Goeran Jerke, Jürgen Scheible, Jens Lienig
ACL
1990
13 years 7 months ago
The Computational Complexity of Avoiding Conversational Implicatures
Referring expressions and other object descriptions should be maximal under the Local Brevity, No Unnecessary Components, and Lexical Preference preference rules; otherwise, they ...
Ehud Reiter