7006 search results - page 363 / 1402 » Approximation Algorithms |
126
click to vote
PAMI
2008
15 years 4 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
167
click to vote
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...
246
click to vote
SIGMOD
2005
ACM
16 years 4 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...
182
click to vote
WADS
2007
Springer
15 years 10 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 ε >...
146
click to vote
SIGMOD
1999
ACM
15 years 8 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...