7930 search results - page 457 / 1586 » Greedy in Approximation Algorithms |
206
click to vote
COCO
1994
Springer
15 years 11 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
239
click to vote
TSMC
2010
15 years 1 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
164
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...
148
Voted
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we present a novel framework for resampling and complexity reduction of tapped delay line channel models. In contrast to related algorithms in this field, our fram...
177
Voted
ICASSP
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we propose a coding algorithm for raw images with high dynamic ranges. Our encoder has two layers. In the first layer, 24 bit low dynamic range image is encoded by...