2520 search results - page 89 / 504 » The complexity of approximating entropy |
99
Voted
ISCAS
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper, a modified version of the complex directional pyramid (PDTDFB) is proposed. Unlike the previous approach, the new FB provides an approximately tight-frame decom...
87
Voted
ICCS
2007
Springer
15 years 4 months ago
2007
Springer
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...
76
Voted
MFCS
2007
Springer
15 years 4 months ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
SMA
1997
ACM
15 years 2 months ago
1997
ACM
Much of recent research in representation schemes for solid modeling was focused on the extension of boundary representations to support non-manifold topologies. We introduce here...
77
Voted
FAW
2008
Springer
15 years 1 hour ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...