Sciweavers

2957 search results - page 346 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
ISCAS
2008
IEEE
94views Hardware» more  ISCAS 2008»
16 years 1 months ago
Transient simulation of on-chip transmission lines via exact pole extraction
— An accurate and efficient solution for the transient response at the far end of a transmission line is proposed in this paper. Unlike approximating the poles by truncating the...
Guoqing Chen, Eby G. Friedman
CISS
2007
IEEE
16 years 28 days ago
Analog Coding for Delay-Limited Applications
— In this paper, we consider the problem of sending an analog source over an additive white Gaussian noise channel. The traditional analog coding schemes suffer from the threshol...
Mahmoud Taherzadeh, Amir K. Khandani
VTC
2007
IEEE
103views Communications» more  VTC 2007»
16 years 25 days ago
A Simple Orthogonal Space-Time-Polarization Block Code
— This letter proposes a simple but highly efficient technique to jointly utilize space, time, and polarization diversities. The technique is based on extending orthogonal space-...
Beata J. Wysocki, Tadeusz A. Wysocki, Jennifer Seb...
ICMCS
2006
IEEE
113views Multimedia» more  ICMCS 2006»
16 years 19 days ago
Fast Multi-Reference Frame Motion Estimation via Downhill Simplex Search
Multi-reference frame motion estimation improves the accuracy of motion compensation in video compression, but it also dramatically increases computational complexity. Based on tr...
Chen-Kuo Chiang, Shang-Hong Lai
COMPGEOM
2006
ACM
16 years 16 days ago
An upper bound on the average size of silhouettes
It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides,...
Marc Glisse