7129 search results - page 347 / 1426 » Approximation Algorithms for Treewidth |
169
click to vote
COCO
1994
Springer
15 years 8 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 ...
140
click to vote
SGP
2003
15 years 6 months ago
2003
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
189
click to vote
TSMC
2010
14 years 11 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...
130
click to vote
ICPR
2008
IEEE
16 years 6 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...
114
click to vote
ICASSP
2008
IEEE
15 years 11 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...