Sciweavers

2520 search results - page 205 / 504
» The complexity of approximating entropy
Sort
View
DAM
2007
177views more  DAM 2007»
15 years 5 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
ICIP
1998
IEEE
16 years 7 months ago
Blind Estimation of PSF for Out of Focus Video Data
A method has beenproposed for blindly estimating the Point Spread Function (PSF) of video data. The PSF's of the images in a sequence are assumed to be of compact support and...
Hassan Shekarforoush, Rama Chellappa
DAC
2009
ACM
16 years 6 months ago
Human computing for EDA
Electronic design automation is a field replete with challenging ? and often intractable ? problems to be solved over very large instances. As a result, the field of design automa...
Andrew DeOrio, Valeria Bertacco
ICPR
2008
IEEE
16 years 10 days ago
Convenient reconstruction of natural plants by images
Convenient reconstruction of natural plants is a difficult task because of their intrinsic complex geometry. In this paper, we propose a convenient image-based approach to modeli...
Wei Ma, Hongbin Zha
GLOBECOM
2007
IEEE
16 years 7 days ago
ARMA Synthesis of Fading Channels- an Application to the Generation of Dynamic MIMO Channels
— Adaptive transceivers play an important role in wireless communications and the design of MIMO systems. Therefore models that enable simulation of dynamic and time varying chan...
Hani Mehrpouyan, Steven D. Blostein