4372 search results - page 347 / 875 » Algorithmic Theories of Everything |
179
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
333
click to vote
Book
"The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, which is the ...
160
click to vote
ICIP
2000
IEEE
16 years 8 months ago
2000
IEEE
A finite implementation of the ridgelet transform is presented. The transform is invertible, non-redundant and achieved via fast algorithms. Furthermore we show that this transfor...
156
click to vote
ICIP
1999
IEEE
16 years 8 months ago
1999
IEEE
The performance of subband image coders depends on the proper choice of filter banks. It is therefore desirable to find algorithms for optimizing the filter banks. A theory for fi...
146
click to vote
ICIP
1995
IEEE
16 years 8 months ago
1995
IEEE
This paper presents mathematical frameworks on temporal predictiveprocessing in the MPEG video compression standard. Firstly, a coding gain is derived based on traditional predict...