1813 search results - page 101 / 363 » Calculi of Approximation Spaces |
142
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
139
click to vote
ESANN
2006
15 years 7 months ago
2006
In this paper, the problem of an optimal transformation of the input space for function approximation problems is addressed. The transformation is defined determining the Mahalanob...
156
click to vote
FOCS
1996
IEEE
15 years 10 months ago
1996
IEEE
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space t...
249
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
172
click to vote
PODS
2005
ACM
15 years 12 months ago
2005
ACM
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hie...