7129 search results - page 375 / 1426 » Approximation Algorithms for Treewidth |
169
Voted
CSDA
2004
15 years 4 months ago
2004
Variable selection consists in identifying a k-subset of a set of original variables that is optimal for a given criterion of adequate approximation to the whole data set. Several...
143
click to vote
SIAMJO
2000
15 years 4 months ago
2000
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
172
Voted
CAGD
2008
15 years 3 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...
286
click to vote
ICDE
2009
IEEE
16 years 6 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...
253
click to vote
SIGMOD
2005
ACM
16 years 5 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...