7930 search results - page 488 / 1586 » Greedy in Approximation Algorithms |
233
click to vote
CAGD
2008
15 years 5 months ago
2008
In this paper we present a local fitting algorithm for converting smooth planar curves to Bsplines. For a smooth planar curve a set of points together with their tangent vectors a...
337
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
309
Voted
SIGMOD
2005
ACM
16 years 7 months ago
2005
ACM
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
184
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
227
click to vote
WADS
2007
Springer
16 years 1 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...