3690 search results - page 443 / 738 » Computation with classical sequents |
174
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
164
Voted
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
Source coding theorems and Shannon rate-distortion functions were studied for the discrete-time Wiener process by Berger and generalized to nonstationary Gaussian autoregressive p...
158
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
This paper considers the development of a general framework for the analysis of transmit beamforming methods in multiple antenna systems with finite-rate feedback. Inspired by the...
172
click to vote
DCC
2001
IEEE
16 years 6 months ago
2001
IEEE
This paper studies quantization error in the context of Matching Pursuit coded streams and proposes a new coefficient quantization scheme taking benefit of the Matching Pursuit pr...
167
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...