2957 search results - page 219 / 592 » The Complexity of Polynomial-Time Approximation |
218
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
215
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
142
click to vote
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...
187
click to vote
WSCG
2001
15 years 8 months ago
2001
This paper demonstrates that techniques in flexible body dynamics can yield surprising results when applied to rigid bodies. The discussion presents a technique for constructing r...
214
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...