Sciweavers

35419 search results - page 28 / 7084
» How Are We Doing
Sort
View
ISSAC
1999
Springer
86views Mathematics» more  ISSAC 1999»
13 years 11 months ago
How Fast Can We Compute Products?
In this paper we consider the problem of fast computation of n-ary products, for large n, over arbitrary precision integer or rational number domains. The combination of loop unro...
V. Kislenkov, V. Mitrofanov, Eugene V. Zima
WCNC
2008
IEEE
14 years 1 months ago
How Much Improvement Can We Get From Partially Overlapped Channels?
—Partially Overlapped Channel (POC) based design, has been identified recently as a promising technique to overcome the capacity bottleneck facing wireless engineers in various ...
Zhenhua Feng, Yaling Yang
DAC
2002
ACM
14 years 8 months ago
Satometer: how much have we searched?
Fadi A. Aloul, Brian D. Sierawski, Karem A. Sakall...
DAC
2005
ACM
14 years 8 months ago
Statistical static timing analysis: how simple can we get?
Chirayu S. Amin, Noel Menezes, Kip Killpack, Flore...
CHI
2003
ACM
14 years 7 months ago
Spam, spam, spam, spam: how can we stop it
Jenny Preece, Jonathan Lazar, Elizabeth F. Churchi...