2520 search results - page 352 / 504 » The complexity of approximating entropy |
284
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
This paper addresses the problem of fully automated
mining of public space video data. A novel Markov Clustering
Topic Model (MCTM) is introduced which builds on
existing Dynami...
173
click to vote
CIMAGING
2009
15 years 4 months ago
2009
We present an extension of the development of an alternating minimization (AM) method1 for the computation of a specimen's complex transmittance function (magnitude and phase...
191
click to vote
EGH
2009
Springer
15 years 4 months ago
2009
Springer
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...
170
click to vote
TCS
2011
15 years 1 months ago
2011
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...
166
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper considers the problem of low complexity implementation of high-performance semidefinite relaxation (SDR) MIMO detection methods. Currently, most SDR MIMO detectors are...