Sciweavers

2957 search results - page 442 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
EGH
2009
Springer
13 years 8 months ago
Parallel view-dependent tessellation of Catmull-Clark subdivision surfaces
We present a strategy for performing view-adaptive, crack-free tessellation of Catmull-Clark subdivision surfaces entirely on programmable graphics hardware. Our scheme extends th...
Anjul Patney, Mohamed S. Ebeida, John D. Owens
TCS
2011
13 years 5 months ago
Optimizing n-variate (n+k)-nomials for small k
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n + 2)-nomial with a constant term, allowing real exponents as well as real...
Philippe P. Pébay, J. Maurice Rojas, David ...
ICASSP
2011
IEEE
13 years 1 months ago
Cheap semidefinite relaxation MIMO detection using row-by-row block coordinate descent
This paper considers the problem of low complexity implementation of high-performance semidefinite relaxation (SDR) MIMO detection methods. Currently, most SDR MIMO detectors are...
Hoi-To Wai, Wing-Kin Ma, Anthony Man-Cho So
ISBI
2011
IEEE
13 years 1 months ago
Sparse topological data recovery in medical images
For medical image analysis, the test statistic of the measurements is usually constructed at every voxels in space and thresholded to determine the regions of significant signals...
Moo K. Chung, Hyekyoung Lee, Peter T. Kim, Jong Ch...
CEC
2010
IEEE
13 years 1 months ago
A hybrid genetic algorithm for rescue path planning in uncertain adversarial environment
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
Jean Berger, Khaled Jabeur, Abdeslem Boukhtouta, A...